Editing Cryptanalysis (section)

==Quantum computing applications for cryptanalysis==
[[Quantum computer]]s, which are still in the early phases of research, have potential use in cryptanalysis. For example, [[Shor's Algorithm]] could factor large numbers in [[polynomial time]], in effect breaking some commonly used forms of public-key encryption.<ref>{{Cite news|url=http://blogs.ams.org/mathgradblog/2014/04/30/shors-algorithm-breaking-rsa-encryption|title=Shor's Algorithm – Breaking RSA Encryption|date=2014-04-30|newspaper=AMS Grad Blog|access-date=2017-01-17}}</ref>

By using [[Grover's algorithm]] on a quantum computer, brute-force key search can be made quadratically faster. However, this could be countered by doubling the key length.<ref name=djb-groverr>{{cite web |date=2010-03-03 |author=Daniel J. Bernstein |title=Grover vs. McEliece |url=http://cr.yp.to/codes/grovercode-20100303.pdf |archive-url=https://ghostarchive.org/archive/20221010/http://cr.yp.to/codes/grovercode-20100303.pdf |archive-date=2022-10-10 |url-status=live |author-link=Daniel J. Bernstein }}</ref>