n this problem, we will implement the RSA algorithm to encrypt and decrypt the message

$148.$

$($a$)$ Set the primes p and q as follows: p $=31$ and q $=47.$ What are the values for N and

$\backslash$Phi $?$

$($b$)$ The value for e is chosen to be $11.$ Use Euclid$$s algorithm to verify that e and $\backslash$Phi are

relatively prime and to find d$,$ the multiplicative inverse of e mod $\backslash$Phi $.$

$($c$)$ Encrypt the message m by computing me mod N $.$

$($d$)$ The result of the previous question is the ciphertext c that is transmitted. To decrypt

the message, compute cd mod N $.$

$1$