q=11. Suppose Alice wants to send a message to Bob using the RSA algorithm and p=...

  

Transcribed Image Text:

q=11. Suppose Alice wants to send a message to Bob using the RSA algorithm and p= 5 and a) What are the values of n and D(n)? b) Let e be 3, find d such that de = 1 mod D(n). c) Encrypt the message m = 9 using the key (n, e). d) How can Alice use her secret key to sign the message? e) How can Bob verify Alice's signature? q=11. Suppose Alice wants to send a message to Bob using the RSA algorithm and p= 5 and a) What are the values of n and D(n)? b) Let e be 3, find d such that de = 1 mod D(n). c) Encrypt the message m = 9 using the key (n, e). d) How can Alice use her secret key to sign the message? e) How can Bob verify Alice's signature?

Answer rating: 100% (QA)

a Values of n and n nMultiply the two prime numbers n p q 5 11 55 nn represents Eulers Totient Function which calculates the number of positive intege... View the full answer