Skip to main content

Up Next

Back to Show
Infinite Series

Hacking at Quantum Speed with Shor's Algorithm

Season 1 Episode 21

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

Support Provided By
Season
The Assassin Puzzle
9:12
Can you save the target from his assassin in a square room with bouncy walls?
Instant Insanity Puzzle
9:32
Can you stack four colored cubes so that each color only shows once on each side?
Defining Infinity
10:31
Set theory is the foundation of all of mathematics. How does it handle infinity?
Unraveling DNA with Rational Tangles
9:36
When you think about math, what do you think of knots? Probably... knot.
How Big are All Infinities Combined? (Cantor's Paradox)
13:02
Infinities come in different sizes. So what's the right way to describe the sum?
The Geometry of SET
10:21
In SET, what is the maximum number of cards you can deal that might not contain a SET?
What was Fermat’s “Marvelous" Proof?
10:50
If Fermat had a little more room in his margin, what proof would he have written there?
What are Numbers Made of?
10:07
In the physical world, objects are made of simpler parts. What are numbers made of?
What Does It Mean to Be a Number? (The Peano Axioms)
9:35
Could you explain numbers to someone without using the notion of a number?
Telling Time on a Torus
7:17
What shape do you most associate with a standard analog clock? Circle or... torus?
How to Divide by "Zero"
8:01
What happens when you divide things that aren’t numbers?
Beyond the Golden Ratio
8:57
You know the Golden Ratio, but what is the Silver Ratio?
Active loading indicator