. RSA public key encryption system. Suppose p = 5 and q = 11 are our large primes.

a. compute the n needed in the RSA algorithm.

b. Explain or show why e = 7 is an acceptable encoding value.

c. Compute the ciphertext for the plaintext character string ENCRYPTION where E = 5, N = 14, , C = 3, R = 18, etc..

Symbol	Numeric(m)	P^7	Cipher- (P^7)mod(55)
E	5
N	14
C	3
R	18
Y	5
P	16
T	20
I	10
O	15
N	14

d. Find a decryption key (there is one less than 30) and show/explain how you found it. Decrypt the values obtained in c. above. See slides.