Question

Discrete Math

In this problem, we will implement the RSA algorithm to encrypt and decrypt the message ”148”.For this exercise, you may want to use some kind of calculator that can compute the mod function.

1. Set the primes p and q as follows:p=31 and q=47. What are the values for N and φ?

2.The value for e is chosen to be 11. Use Euclid’s algorithm to verify that e and φ are relatively prime and to find d, the multiplicative inverse of e modφ.

3. Encrypt the message m by computing m^e mod N

4.The result of the previous question is the ciphertext c that is transmitted. To decrypt the message, compute c^d mod N.

Answer 1

Any queries just comment

Give thumbsup

Thank you and all the best