RSA Programming Lab Testing Quiz

Answer the following questions. Provide full solution when is required. If you didn't complete your program, solve all questions and provide detailed solution to receive PATIAL credit for the graded lab

Students who wrote the program, make sure your program outputs the following information: p, q, e (in case of random generation), n and d - in all cases, numeric values of input plaintext/ciphertext, numeric values of the found final plaintext/ciphertext and the final plaintext/chipertext.

• Problem 1: Use repeated squaring approach, calculate the following modular exponentions. Show your calculations in detail for ONE problem below. Write results for all problems below and compare final result with the program output (copy the function that does modular exponention into separate program or add print statement to print results).
  • 3^72 (mod 143)
  • 16^10 (mod 230)
  • 4^22(mod 11)
• Problem 2: p = 112 q = 157 e = 11. Encrypt GO if possible. If impossible, expain why.
• Problem 3: p = 113 q = 157 e = 11. Encrypt GO if possible. If impossible, expain why.
• Problem 4: If you used base 26: p = 683 q = 883 e = 12707. Decrypt MODX. If you used base 27: the ciphretext is ACMMJ
• Problem 5: p = 997 q = 953 e = 12707. If you used 26 base sysem decrypt QFVD. If you used base 27: the ciphretext is JBQL
• Problem 6: p = 997 q = 953 e = 127. Encrypt YANA

Important: for students who wrote the program we also need to test encryption mode 2: random generation of primes p and q and e. Run your program several times for the plaintexts of your choice and document the output.