Shor's Algorithm (Quantum Computing)
The theoretical threat to all modern encryption.
Mathematician Peter Shor formulated a quantum algorithm that could factor large integers exponentially faster than the best-known classical algorithms.
Open in interactive timeline →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.
Frequently Asked Questions
What was Shor's Algorithm (Quantum Computing)?
Mathematician Peter Shor formulated a quantum algorithm that could factor large integers exponentially faster than the best-known classical algorithms.
When did Shor's Algorithm (Quantum Computing) happen?
Shor's Algorithm (Quantum Computing): 1994 CE.
Why does Shor's Algorithm (Quantum Computing) matter?
The theoretical threat to all modern encryption.
Sources & Further Reading
Cite This Page
AskHistoryAI. “Shor's Algorithm (Quantum Computing).” AskHistoryAI — Interactive Timeline of Everything. Updated 2026-09-11. https://askhistoryai.com/event/tech-shor-algo/
Every fact on this page is checked against the published fact ledger and methodology; sources are listed above.