How Quantum Computers Break Encryption | Shor's Algorithm Explained
Overview
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.
On Hacker News
HN commenters point to it as a clear, approachable explanation of Shor's algorithm and what quantum computers actually do.
Topics
Sources
Video by minutephysics, played through YouTube.
Data and selection notes
HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.
HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.
Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.
Selection checks
- SaaS & AI candidates: Topic keywords do not match
- Editor-approved picks: Editorial review is required
What people said