Classical computers struggle to crack modern encryption. But quantum computers using Shor’s Algorithm make short work of RSA cryptography. Find out how.

Tweet at us! @pbsinfinite
Facebook: facebook.com/pbsinfinite series
Email us! pbsinfiniteseries [at] gmail [dot] com

Previous Episode
How to Break Cryptography

The Mathematics Behind Quantum Computers

Additional Resources:
Scott Aaronson’s Blog (Great Intro to Shor’s Alg.):: http://www.scottaaronson.com/blog/?p=208

Shor’s Original Paper:: https://arxiv.org/abs/quant-ph/9508027v2

Lectures on Shor’s Algorithm:: https://arxiv.org/pdf/quant-ph/0010034.pdf

Decrypting secure messages often involves attempting to find the factors that make up extremely large numbers. This process is too time consuming for classical computers but Shor’s Algorithm shows us how Quantum Computers can greatly expedite the process.

Written and Hosted by Kelsey Houston-Edwards
Produced by Rusty Ward
Graphics by Ray Lux
Made by Kornhaber Brown (www.kornhaberbrown.com)

Thanks to Spiros Michalakis for helpful discussions and feedback.

Comments answered by Kelsey:

Neon Bull

Bhargav R

BobC


source