Consider RSA with p = 5 and q = 11. a. What are n and (n)?

b. Let e be 3. Why is this an acceptable choice for e

c. Find d such that d.e = 1 (mod z) and d < 160.

d. Encrypt the message m = 8 using the key (n, e). Let c denote the

corresponding ciphertext. Show all work. Hint: To simplify the

calculations, use the fact: [(a mod n) (b mod n)] mod n = (a* b) mod n