RSA is Dead. Long Live BB84!
summary
Claims that Shor’s algorithm will break RSA are grounded in a demonstrated Q# implementation and an example where factoring 1517 uses the period of 14 (period 24) to produce factors, while a colleague’s run takes ~90 minutes to factor 35 on a Mac. Practical breakage needs roughly 3× key bits in qubits (so ~6000 qubits for 2048-bit RSA) yet current devices are about 100 qubits. BB84 is shown with polarizing filters (three-filter interference) and LWE is noted as a classical quantum‑safe candidate.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 0:47Todays topic
- 1:57Yesterday
- 2:57Pub Quiz
- 4:18Alice and Bob
- 5:12Public Key Cryptography
- 6:32Quantum Computing
- 12:46Youngs Double Slit Experiment
- 17:10Quantum Fourier Transform
- 18:24Shor Algorithm
- 30:55Polarization Light
- 33:45Alignment
- 36:26How does BB84 work
- 37:01How BB84 works
- 39:23QKD networks
- 40:02History lesson
- 42:43Questions
related talks
57mShor's Algorithm is Scary NOW
11mWhy we should be scared of Shor's Algorithm right now
20mPost-Quantum Cryptography- Preparing digital communication for a Q
44mWhy Quantum Safe Encryption Is the Next Y2K, and How To Be Prepared
37mIntroducing the Post-Quantum Cryptography Alliance
28mPost-Quantum Manifesto
32mCybersecurity in Post Quantum Era
54mReducing the number of qubits in quantum factoring