In-Depth Explanation and Demonstration of the RSA Algorithm

In this video, i have discussed RSA Algorithm in detail, and other related concepts such as Basic Difference between Symmetric and Asymmetric cryptography, Primality, Co-Prime Numbers, Euler's theorem, Euler's totient function, How to calculate Euler's totient function, Modular Multiplicative Inverse and its calculation, how RSA works, how public & private keys are computed, how do we compute ciphertext and plaintext, implementation of RSA algorithm encryption and decryption in Python etcetera. TimeStamps of the topics covered in this video are below: [00:00] - Intro [00:03] - Contents [01:15] - Intro to RSA Algorithm [02:14] - Symmetric Cryptography [03:08] - Asymmetric Cryptography [05:54] - Primality Test [06:25] - Co-Prime Numbers [07:14] - Euler's Theorem [08:39] - Euler's Totient Function & calculation of phi(n) [10:20] - Modular Multiplicative Inverse and it's calculation [12:36] - RSA Algorithm working mechanism (step by step) [16:34] - Encryption & Decryption on Integers [17:56] - Encryption & Decryption on letters & characters [20:38] - Exercise Link to the RSAalgo tool: https://github.com/prodigiousMind/RSAalgo.git Thanks For Watching This Video. Like & Subscribe