Claim record · edition 0.1.0
qc-006Established result
Shor’s algorithm gives polynomial-time quantum algorithms for integer factorization and discrete logarithms on a suitable quantum computer.
This is why large-scale fault-tolerant quantum computing matters for some public-key cryptography.
Limits of this claim
The algorithm does not establish that a current device can break deployed cryptographic systems, nor does it apply to all cryptography.
Supporting sources
primary paper · verified
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Peter W. Shor · 1995
Primary source for the factoring and discrete-logarithm algorithm.
Source record →