How Quantum Computers Break Encryption | Shor's Algorithm Explained
minutephysics · 3 則 HN 推薦
影片問答
可以請 AI 解釋目前片段，或總結整部影片。如果回答附有時間戳記，點選即可跳到對應片段。
試著問：這裡講的是什麼意思？
需使用 Google 登入。確認前可查看最多會扣除多少點數。
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 推薦的原因： 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.” 閱讀 HN 討論 ↗