How Quantum Computers Break Encryption | Shor's Algorithm Explained
minutephysics3 HN recommenders · 2019–2023
3.4M views · explainer · evergreen · Uploaded 2019-05-01
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.
1:28:23Quantum Computing for Computer Scientists
Microsoft Research
51:32Behind the Scenes of iOS Security
Black Hat
12:01Why Electronic Voting Is Still A Bad Idea
Tom Scott
25:16But how does bitcoin actually work?
3Blue1Brown
8:38Diffie-Hellman Key Exchange
Art of the Problem
48:02BlackHat USA 2011: SSL And The Future Of Authenticity
Christiaan008
14:34Blockchains Are a Bad Idea (James Mickens)
HBS Digital Initiative
2:18:23Line Goes Up – The Problem With NFTs
Folding Ideas
3 comments from Hacker News
Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing. [VIDEO] And the followup: [LINK]
This helped me a lot and I think it made the rounds on hackernews a while back as well. [LINK] There's also this video which walks through how quantum computers solve a very specific factoring problem (Shor's Algorithm) in a way that classical computers cannot. [VIDEO]
This video clears a most important misconception everyone has regarding QC which is "How a QC does operation's parallelly and what does that even mean when you can only get 1 output irl?" I hope I myself have understood it correctly if that's right Also Minute Physics video for the Shor's Algorithm is good explaination [VIDEO]