PBS Infinite Series | (Almost) Unbreakable Crypto | Infinite Series @pbsinfiniteseries | Uploaded 6 years ago | Updated 3 hours ago
Viewers like you help make PBS (Thank you š) . Support your local PBS Member Station here: to.pbs.org/donateinfi
Despite what many believe, the essence of encryption isnāt really about factoring or prime numbers. So what is it about? Thanks to Vanessa Hill for playing the part of our evil hacker! Be sure to check out Braincraft youtube.com/channel/UCt_t6FwNsqr3WWoL6dFqG9w
Tweet at us! @pbsinfinite
Facebook: facebook.com/pbsinfinite series
Email us! pbsinfiniteseries [at] gmail [dot] com
Previous Episode
Associahedra: The Shapes of Multiplication | Infinite Series
youtube.com/watch?v=N7wNWQ4aTLQ
In previous episodes, Kelsey explained how you could crack RSA encryption with an algorithm capable of quickly factoring ginormous numbers into primes. That might give you the impression that fast factoring algorithms would compromise all digital encryption. But not so -- for instance, YouTube's encryption of this video would be unaffected. And that's because the essence of encryption isnāt really about factoring or prime numbers per se. So what is it about?
Written and Hosted by Gabe Perez-Giz
Produced by Rusty Ward
Graphics by Ray Lux
Assistant Editing and Sound Design by Mike Petrow and Meah Denee Barrington
Made by Kornhaber Brown (www.kornhaberbrown.com)
Thanks to Matthew O'Connor and Yana Chernobilsky who are supporting us on Patreon at the Identity level!
And thanks to Nicholas Rose and Mauricio Pacheco who are supporting us at the Lemma level!
Viewers like you help make PBS (Thank you š) . Support your local PBS Member Station here: to.pbs.org/donateinfi
Despite what many believe, the essence of encryption isnāt really about factoring or prime numbers. So what is it about? Thanks to Vanessa Hill for playing the part of our evil hacker! Be sure to check out Braincraft youtube.com/channel/UCt_t6FwNsqr3WWoL6dFqG9w
Tweet at us! @pbsinfinite
Facebook: facebook.com/pbsinfinite series
Email us! pbsinfiniteseries [at] gmail [dot] com
Previous Episode
Associahedra: The Shapes of Multiplication | Infinite Series
youtube.com/watch?v=N7wNWQ4aTLQ
In previous episodes, Kelsey explained how you could crack RSA encryption with an algorithm capable of quickly factoring ginormous numbers into primes. That might give you the impression that fast factoring algorithms would compromise all digital encryption. But not so -- for instance, YouTube's encryption of this video would be unaffected. And that's because the essence of encryption isnāt really about factoring or prime numbers per se. So what is it about?
Written and Hosted by Gabe Perez-Giz
Produced by Rusty Ward
Graphics by Ray Lux
Assistant Editing and Sound Design by Mike Petrow and Meah Denee Barrington
Made by Kornhaber Brown (www.kornhaberbrown.com)
Thanks to Matthew O'Connor and Yana Chernobilsky who are supporting us on Patreon at the Identity level!
And thanks to Nicholas Rose and Mauricio Pacheco who are supporting us at the Lemma level!
