Support me on Patreon! https://www.patreon.com/PurpleMindCS
If you'd like to aid the success of this channel, this is the best way to do it! Every contribution is sincerely, greatly, appreciated.
This is the first video in a series about modern encryption. How is it possible to send private data over public networks in a manner that is practical, efficient, and most importantly, secure? In this series, I show you how some of the most technical encryption schemes are a lot simpler than you might think, and can actually be thought of using analogies with physical real-world objects, such as mixing colors of paint together or making a transaction with a padlocked box. The actual implementations of modern encryption protocols involve some beautiful mathematics -- here we take a high-level approach and view the relevant math as a tool that implements the core concepts which make modern encryption possible. We cover two early encryption schemes, Caesar ciphers and One-Time Pads, before delving into the first ever public-key encryption method, Diffie-Hellman Key Exchange. In the next video, we will cover RSA encryption, and its unique advantages that further improve upon Diffie-Hellman Key Exchange.
If you or your institution is interested in sponsoring the topic of a future PurpleMind video, please contact me via purplemindcs@gmail.com!
Brittle Rille - Reunited by Kevin MacLeod is licensed under a Creative Commons Attribution 4.0 license. https://creativecommons.org/licenses/by/4.0/
Math animations are made using Manim, by 3Blue1Brown.
Discord Server: https://discord.gg/smuxnzZ5Zf. Feel free to join!
Business Inquiries: purplemindcs@gmail.com