In part 2 of this series, we beefed up the implementation of RSA to include the ability to use real world sized prime numbers in order to keep communications safe and secure. If you followed along, you should now have code that looks like this:
Category: Encryption
If you followed along with part 1 of this series, you should have code that very closely resembles something like this:
I was recently tasked with implementing RSA encryption through python.
While I could have used an encryption library that was already written (and tested and verified to be secure..), the assignment was for the fun of it and not protecting any real world communication so I thought it would be fun to roll my own RSA encryption scheme and see how it shakes out.
If you, like me, feel as though the best way to understand something is to code it, then this post is for you.
Assumptions I make about you as the reader:
- You already know and understand the basics of asymmetric encryption
- You are familiar with object oriented programming
- You can read and follow python code
If the first point doesn’t apply, you should check out this article and then come back and check out my coding solution.