Paper1997
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Peter W. Shor
Gives an algorithm that factors integers in polynomial time on a quantum computer, undermining the hardness assumption RSA encryption relies on.
26 pageslink checked 17 Sept 2026FreeAdvanced