Shor's Algorithm (Quantum Computing)
The theoretical threat to all modern encryption.
Explore this event on the interactive timeline →Mathematician Peter Shor formulated a quantum algorithm that could factor large integers exponentially faster than the best-known classical algorithms.
Key Numbers
- Impact
- Breaks RSA Encryption
- Execution Time
- Polynomial (Quantum)
Verified Facts
- This proved theoretically that a sufficiently large quantum computer could break RSA encryption, the foundation of all secure internet communications and banking.
- This mathematical proof triggered the global, multi-billion dollar arms race between nation-states and tech giants to build the first physical, fault-tolerant quantum computer.