How Quantum Computers Break Encryption | Shor's Algorithm Explained

Name: How Quantum Computers Break Encryption | Shor's Algorithm Explained
Description: 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.

minutephysics

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.

HN commenters point to it as a clear, approachable explanation of Shor's algorithm and what quantum computers actually do.

3 Hacker News mentions · 2019–2023

Topics

Quantum computing
Cryptography

Watch on YouTube

Explore more videos