RSA (Rivest-Shamir-Adleman) is an algorithm used by modern computers to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm. Thus it involves the use of 2 seperate keys for encryption and decryption. This is also called public key cryptography because one of the keys can be given to anyone. The other key must be kept private. The algorithm is robust as it is based on the fact that finding the factors of a large composite number is difficult: especially when the factors are random prime numbers. Hence even if the public key is known it is difficult to find the private key.
This is not the original RSA implementation. Considering the system limitations, the following implementation encrypts letter by letter. Also uses a padding scheme to add digits at alternate places to ensure that same letter doesn't get encrypted to the same number.
The data to be encrypted has to be written into the file toBeEncrypted.txt .
Two files will be created namely encrypted.txt and Decrypted.txt in the same folder containing
encrypted and decrypted data respectively.
- To run:
python RSA_filehandling.py
NOTE: If you are running the program more than once make sure the previoiusly
created `encrypted.txt` and `Decrypted.txt` are deleted from the directory.
A message box will appear right after running the program. The buttons Encrypt and Decrypt will perform the respective operations.
- To run:
python RSA_GUI.py
