Question: Q2. Consider the RSA algorithm with public key e = 5 and m = 91. (Note that this is a mock example of RSA. The

Q2. Consider the RSA algorithm with public key e = 5 and m = 91. (Note that this is a mock example of RSA. The numbers e, d and m consist of hundreds of digits in real life RSA algorithms.) a. [10 pts] What would be a suitable private key, d? b. [5 pts] Suppose you would like to send the plaintext corresponding to number "5" using this RSA mechanism. What is the number corresponding to the "ciphertext"? c. [5 pts] How does the receiver of the message decrypt the ciphertext
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
