RSA - The Elegance of Public Key Cryptography

Do you know what powers the web security all over the Internet? Its a cryptographic algorithm which relies on inconvenience of prime factorization. This video talks about RSA - a public key cipher which uses two very large primes to create keys for encryption/decryption. Developed in the 1970s by three MIT researchers, RSA remains one of the most important tools in modern digital security. 00:00 Factoring a Large Number 01:24 Background of RSA 02:27 Key Generation 04:31 Example of RSA 07:01 Application of RSA 08:27 Conclusion Determining Multiplicative Inverse : https://extendedeuclideanalgorithm.com/multiplicative_inverse.php Proof of phi(ab) = phi(a).phi(b) : https://sumantmath.wordpress.com/2020/11/03/proof-why-phiab-phiaphib-when-ab1/ Proof of Euler's Theorem : https://math.stackexchange.com/questions/50542/proof-of-eulers-theorem-without-abstract-algebra RSA Original Paper (1978) : https://people.csail.mit.edu/rivest/Rsapaper.pdf This video wouldn't be possible without the open source library manim created by 3blue1brown: https://github.com/3b1b/manim Follow me on: GitHub: https://github.com/vercetti322 LinkedIn: https://www.linkedin.com/in/jatinjindal322/ Instagram: https://www.instagram.com/_.jatin_.jindal/