Lab1-P1

(This repository makes sense in CC5312 - Computer Security course)

Behold! The best RSA key generation algorithm of the world!

This is an example of how to use my excellent key generation function.

How to use

pip install requirements.txt
python main.py

The previous command will create three files:

• plaintext.txt: A random latin-like sentence (thanks to lorem library)
• ciphered.txt: The previous latin-like sentence, ciphered with a random Public RSA key.
• deciphered.txt: The previous ciphered text, deciphered with the correspondent Private RSA Key (This is to show you that my keys work!)
• public_key.pem: Public Key that encrypted the message.

Given the private key is lost, I guarantee that you will never be able to decipher the ciphered text!

Solution

We use Decimal library to operate with big numbers without the need of installing C libraries.

The error on the implementation is on the function next_prime. That function makes the two primes so close that it is easy to find them if we start the search in sqrt(n). Then, we can use the functions in utils library to create the secret key and decrypt the message.