Cryptography with Python 14: Asymmetric encryption with RSA

Entire course: ➡️ https://www.youtube.com/playlist?list=PLWjMI9CAmVU4–SmpzgswTvxLkZqC9QWn

⏰ Timestamps for content in this video ⏰

00:00 Asymmetric encryption
01:59 Introducing the RSA public-key encryption system
04:37 Generating large prime numbers with Miller-Rabin primality test
08:14 Generating a public RSA key
09:19 Generating a private RSA key with the extended Euclidean algorithm
10:47 Mathematics of RSA encryption
11:39 Mathematics of RSA decryption
13:00 Asymmetric key distribution problem
14:08 Comparing symmetric encryption with asymmetric encryption

🔷🔷 About 🔷🔷

This Fundamental Cryptography in Theory and Python lesson presents the concept of asymmetric encryption, introduces the RSA public-key encryption system, and concludes with a comparison of symmetric encryption systems with asymmetric encryption systems.

📝 Resources used and created for code lessons 📝

https://github.com/cgossi/fundamental_cryptography_with_python

🔗 Links included in this video 🔗

https://en.wikipedia.org/wiki/RSA_(cryptosystem%29
https://en.wikipedia.org/wiki/Miller-Rabin_primality_test
https://www.keylength.com/en/4
https://en.wikipedia.org/wiki/Integer_factorization