Print('END OF THE STEPS USED TO ACHIEVE THE VALUE OF 'd'.') Print('END OF THE STEPS USED TO ACHIEVE EUCLID'S ALGORITHM.') '''CALCULATION OF 'd', PRIVATE KEY, AND PUBLIC KEY.''' '''FINDS THE HIGHEST POSSIBLE VALUE OF 'e' BETWEEN THAT MAKES (e,r) COPRIME.''' '''CALCULATION OF GCD FOR 'e' CALCULATION.''' While(((check_p=False)or(check_q=False))): '''THIS FUNCTION AND THE CODE IMMEDIATELY BELOW THE FUNCTION CHECKS WHETHER THE INPUTS ARE PRIME OR NOT.''' Q = int(input('Enter a prime number for q: ')) P = int(input('Enter a prime number for p: ')) Print('PLEASE ENTER THE 'p' AND 'q' VALUES BELOW:')

THIS IS AN INTERACTIVE TOOL USED TO ENCRYPT OR DECRYPT A MESSAGE USING THE FAMOUS RSA ALGORITHM. There are 167 lines of code in the main program and 71 lines in the test output. Appending code from different sources is a very useful concept in Computer Science, and it shows that I can recycle existing ideas and models to create new ones. I learned to put together different functions, convert them from a mathematical perspective to a programmer perspective, and produce a completely different output. I was required to know and understand every step of the algorithm in a detailed manner. To write this program, I needed to know how to write the algorithms for the Euler’s Totient, GCD, checking for prime numbers, multiplicative inverse, encryption, and decryption. The below program is an implementation of the famous RSA Algorithm.

Python decrypt rsa manually