Unlocking RSA Cryptography: The Math Behind Secure Encryption 🔐

In this, I talk about the math involved in RSA Encryption and Key Generation in detail. I also present the necessary prerequisites like Modular Arithmetic, Euler's Totient Function, Euler's Theorem etc.

#RSA #Cryptography #Math #Encryption
00:00 RSA Demo
3:43 Number of Keys (Symmetric vs Asymmetric)
6:40 Fundamental Theorem of Arithmetic
7:40 One-way Function
11:56 Trapdoor Function
13:23 Modular Arithmetic
14:31 Euler's Totient Function
17:01 Euler's Theorem
18:44 RSA Encryption/ Decryption
22:42 RSA Example
26:34 Creating RSA Keys
38:02 RSA in Real Life



Here are other RSA videos you can watch as well—
Art of the Problem— https://youtu.be/wXB-V_Keiu8
Eddie Woo—https://youtu.be/4zahvcJ9glg