Master RSA Encryption in Python: Step-by-Step Tutorial 🔐

In this video, we go through the RSA Asymmetric Key Encryption algorithm first with pen and paper then through its implementation in Python. I used Python due to its natural, built-in big number libraries.

Includes random key generation with large prime numbers.

Time Stamps:
• Explanation, pen/paper example: 0:00 - 25:52
• Python implementation: 25:52 - 1:13:33

Mathematical concepts covered: one-way function, modular exponentiation, modular multiplicative inverse, extended euclidean algorithm, prime numbers, rabin-miller

• RSA Overview: https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Code
• ASCII Table: http://html-codes.info/ascii/standard/What-is-the-ASCII-value-of-letter
• Low Prime Numbers List: https://pastebin.com/2yGpCpJr
• Prime Number Checker: https://www.numberempire.com/primenumbers.php
• Rabin-Miller Algorithm: https://www.geeksforgeeks.org/primality-test-set-3-miller-rabin/

• Website: https://michaelg29.github.io/
• Twitter: https://twitter.com/MichaelGrieco10
• Discord: https://discord.gg/Uj54bDF
• This Github Repo: https://github.com/michaelg29/yt-challenges
• This Playlist: https://www.youtube.com/playlist?list=PLysLvOneEETP-XQZQ6VTdMIHmxbGxX6nX