Quantum Computing: One Weird Trick to Break RSA Encryption
summary
Claim: Shor's algorithm can reduce factoring of RSA-sized keys from trillions of years classically to about 100 seconds on a large fault-tolerant quantum computer. Current devices are NISQ-era (dozens–hundreds of noisy qubits); realistic breaking requires roughly 10,000 logical qubits which implies on the order of 10 million physical qubits after error correction and long coherence times. Timeline estimates center on 15–20 years but NIST already pushes post‑quantum standards (selection due ~2022), and physical countermeasures like BB84 QKD exist but need specialized hardware and have deployment limits.
AI-written summary · about
chapters (22)
- 0:00Introduction
- 2:11Quantum isnt new
- 2:57Quantum mechanical model
- 3:17First quantum algorithms
- 3:47Quantum computing industry
- 4:26What are quantum computers
- 6:14Entanglement
- 7:02Moores Law
- 8:18Quantum Computing
- 10:55Quantum Algorithms
- 13:47RSA
- 14:45Shors Algorithm
- 17:56Quantum World
- 18:12Quantum Error Correction
- 21:45Divincenzo Criteria
- 23:43Quantum Volume Metric
- 25:33NIST Competition
- 27:14Properties of Quantum Cryptography
- 27:49Quantum Cryptography
- 32:24Future of Quantum Computing
- 33:14What Skills Do You Need
- 36:19Conclusion
related talks
33mWhat is it going to take to break cryptography with a quantum computer
57mShor's Algorithm is Scary NOW
32mCybersecurity in Post Quantum Era
28mPost-Quantum Manifesto
25mCrypto's Quantum Leap: Blockchain vs Quantum Computer
14mWhy post-quantum cryptography?
35mQuantum Algorithms in our Life
30mNavigating the Quantum Readiness Journey: Hands-on Guidance for Starting Your Migration-