How prime numbers protect your privacy #SoME2

Most of us have probably heard about encryption before, but have you ever wondered how it works? This video explores the math behind the RSA cryptosystem, a very popular encryption method that set the stage for asymmetric cryptography. ► Join my Discord server: https://discord.gg/FJqqvqHaZS This video was made as part of the Summer of Mathematical Exposition organized by @3blue1brown ► Sources: - https://en.wikipedia.org/wiki/RSA_(cryptosystem) - https://medium.com/asecuritysite-when-bob-met-alice/rsa-gradually-leaves-the-stage-after-more-than-40-years-as-a-leader-and-its-its-friend-tls-b1d7ce51b093 - https://en.wikipedia.org/wiki/Prime_number ► Learn more about... - Bézout's identity: https://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity - The extended Euclidean algorithm: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm - Modular exponentiation: https://en.wikipedia.org/wiki/Modular_exponentiation ► Stock footage from: https://pixabay.com/ 🎵 Music from Epidemic Sound, register with my link to support the channel and get a discount: https://www.epidemicsound.com/referral/tgmxaf Chapters: 0:00 - Intro 0:35 - Alice and Bob 01:10 - Encryption 02:01 - Asymmetric cryptography 03:22 - Rivest-Shamir-Adleman 03:50 - Modular congruence 04:59 - The RSA Equation 05:52 - Prime numbers 07:27 - Generating a keyset 09:19 - Implementation 10:25 - Proof of correctness 12:42 - Conclusion #SoME2