Programming Challenges - 5 - RSA Encryption (Python)
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_(cr...
• ASCII Table: http://html-codes.info/ascii/standard...
• Low Prime Numbers List: https://pastebin.com/2yGpCpJr
• Prime Number Checker: https://www.numberempire.com/primenum...
• Rabin-Miller Algorithm: https://www.geeksforgeeks.org/primali...
• Website: https://michaelg29.github.io/
• Twitter: / michaelgrieco10
• Discord: / discord
• This Github Repo: https://github.com/michaelg29/yt-chal...
• This Playlist: • Programming Challenges