A full implementation of the RSA encryption method from scratch
RSA encryption secures the modern digital world. RSA encryption relies on modular arithmetic and how difficult it is to factor the product of two large prime numbers. This project aims to show how this encryption works in an accessible manner. Currently, this implementation can only handle key sizes as large as 1024 bits.
Since this project aims to transparently show how RSA encryption works, the only dependencies are the Python standard library and the built-in math module.
RSA encryption works with the receiver first sharing a public key. There are two parts to the public key, and they will both be used to encrypt messages. To get the public key and private key, run the following command:
$ python receiver.py get_keys
--Public Key--
n = ...
e = 65537 (this is standard for RSA encryption)
--Private Key--
p = ...
q = ...
Private Key = ...
Time-to-Complete: ...
After sharing the values of n and e, the public key, the sender can run the following command to encrypt a message.
$ python sender.py
Enter message: "..."
Finally, after sending the encrypted message to the receiver, run the following command and fill out the prompts.
$ python receiver.py decrypt
Deciphered Message: "..."
Time-to-Complete: ...
This project was created and is maintained @atomicsorcerer.