How Quantum Computers Break Encryption | Shor's Algorithm Explained
minutephysics · 3 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
MinutePhysics explains Shor's algorithm, showing how a quantum computer factors large integers by finding the period of a number modulo N. It walks through the modular arithmetic and number theory that give the exponential speedup over classical factoring, and why this threatens encryption.
Why HN recommends it: HN commenters point to it as a clear, approachable explanation of Shor's algorithm and what quantum computers actually do.
“Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing.” Read on HN ↗