HN Theater @HNTheaterMonth

The best talks and videos of Hacker News.

Hacker News Comments on
How Quantum Computers Break Encryption | Shor's Algorithm Explained

minutephysics · Youtube · 5 HN points · 3 HN comments
HN Theater has aggregated all Hacker News stories and comments that mention minutephysics's video "How Quantum Computers Break Encryption | Shor's Algorithm Explained".
Youtube Summary
Go to http://www.dashlane.com/minutephysics to download Dashlane for free, and use offer code minutephysics for 10% off Dashlane Premium!

Support MinutePhysics on Patreon! http://www.patreon.com/minutephysics

This video explains Shor’s Algorithm, a way to efficiently factor large pseudoprime integers into their prime factors using a quantum computer. The quantum computation relies on the number-theoretic analysis of the factoring problem via modular arithmetic mod N (where N is the number to be factored), and finding the order or period of a random coprime number mod N. The exponential speedup comes in part from the use of the quantum fast fourier transform which achieves interference among frequencies that are not related to the period (period-finding is the goal of the QFT FFT).

REFERENCES

RSA Numbers (sample large numbers to try factoring)
https://en.wikipedia.org/wiki/RSA_numbers

IBM on RSA
https://www.ibm.com/support/knowledgecenter/en/SSB23S1.1.0.13/gtps7/s7pkey.html

Modulo Multiplication Group Tables
http://mathworld.wolfram.com/ModuloMultiplicationGroup.html

Difference of squares factorization
https://en.wikipedia.org/wiki/Difference_of_two_squares

Euclid’s Algorithm
https://en.wikipedia.org/wiki/Euclideanalgorithm

Rational sieve for factoring
https://en.wikipedia.org/wiki/Rational_sieve

General Number field Sieve
https://en.wikipedia.org/wiki/Generalnumberfieldsieve

Scott Aaronson blog post about Shor’s Algorithm
https://www.scottaaronson.com/blog/?p=208

Experimental implementation of Shor’s Algorithm (factoring 15, 21, and 35)
https://arxiv.org/pdf/1903.00768.pdf

Adiabatic Quantum Computation factoring the number 291311
https://arxiv.org/pdf/1706.08061.pdf

Scott Aaronson course notes
https://www.scottaaronson.com/qclec/
https://www.scottaaronson.com/qclec/combined.pdf

Shor’s Algorithm on Quantiki
https://www.quantiki.org/wiki/shors-factoring-algorithm

TLS And SSL use RSA encryption
https://en.wikipedia.org/wiki/TransportLayerSecurity

Dashlane security whitepaper
https://www.dashlane.com/download/DashlaneSecurityWhitePaperOctober2018.pdf


Link to Patreon Supporters: http://www.minutephysics.com/supporters/

MinutePhysics is on twitter - @minutephysics

And facebook - http://facebook.com/minutephysics

Minute Physics provides an energetic and entertaining view of old and new problems in physics -- all in a minute!

Created by Henry Reich
HN Theater Rankings

Hacker News Stories and Comments

All the comments and stories posted to Hacker News that reference this video.
This helped me a lot and I think it made the rounds on hackernews a while back as well. https://quantum.country/

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. https://www.youtube.com/watch?v=lvTqbM5Dq4Q

Check this video from minutephysics about Shor's algorithm: https://youtu.be/lvTqbM5Dq4Q
Minute Physics has a really good explanation of Shor's algorithm, and by proxy, Quantum computing. https://www.youtube.com/watch?v=lvTqbM5Dq4Q

And the followup: https://www.youtube.com/watch?v=FRZQ-efABeQ

May 04, 2019 · 2 points, 0 comments · submitted by HNLurker2
May 01, 2019 · 3 points, 0 comments · submitted by HNLurker2
HN Theater is an independent project and is not operated by Y Combinator or any of the video hosting platforms linked to on this site.
~ yaj@
;laksdfhjdhksalkfj more things
yahnd.com ~ Privacy Policy ~
Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.