Shor's Algorithm is Scary NOW
summary
A Q# implementation simulates Shor to factor 21 and a colleague’s Q# run factors 35 while a hand-built spreadsheet traces period finding to factor 1517, showing the classical work explodes into huge intermediate values; the claim is that quantum period finding removes that work and you need ~6,000 qubits to break RSA‑2048, yet public devices sit near 100 qubits and Google claims quantum supremacy. A hands-on BB84 demo uses polarising filters to show secure key distribution and real networks exist via satellite relays and 25 km fiber trials.
AI-written summary · about
chapters (27)
- 0:00Start
- 1:13Who Am I
- 2:04Dora Maar Exhibition
- 3:25101 on Cryptography
- 5:08Modern Cryptography
- 6:02Quantum Computers
- 6:19Max Planck
- 7:16Quantum Computers and Classical Computers
- 8:10What's a Quantum Computer
- 11:43The Double Slit Experiment
- 14:34Albert Einstein Quote
- 15:37Double Slit Experiment
- 15:57Wave Particle Duality
- 17:21The Many-Worlds Interpretation of Quantum Physics
- 18:45Quantum Circuit Diagram
- 19:41Quantum Fourier Transform
- 20:42What Is Shor's Algorithm
- 21:04Example of How Shor's Algorithm Works
- 27:20How Shor's Algorithm Works in Real Numbers
- 29:04David Deutsch
- 31:27Shor's Algorithm Works
- 47:54History Lesson
- 48:05History of Public Key Cryptography
- 50:50Quantum Chemistry
- 52:03Harbour Process for Synthesizing Ammonia
- 54:30Quantum Computer Simulator
- 55:53Shor's Algorithm Is a Deterministic Algorithm
related talks
11mWhy we should be scared of Shor's Algorithm right now
48mRSA is Dead. Long Live BB84!
40mQuantum Computing: One Weird Trick to Break RSA Encryption
35mQuantum Algorithms in our Life
19mThe Quantum Threat – When Should We Act and What Should We Do?
37mIntroducing the Post-Quantum Cryptography Alliance
13mQuantum Computing Encryption
44mCryptography and Quantum Computing Concerns