RUN

mainGUI.py

The implementation is done with out the use of RSA python library packages.

the EEA file contains extended euclidean algorithm to find three GCD of the prime number that are generated.

generate_prime.py has functions to generate prime numbers based on miller robin primality test and fermat primality test.

when you run mainGUI.py you will see.

click on NEW to generate new pair of prime numbers p and q.

Navigate to Encryption load your text or type your text in message box. and click Encrypt.

Navigate to decrypt and click show text: it will show the encrypted message and now you click decrypt to decrypt the encrypted message.