RSA with three primes would also work: n = pqr, ?(n) = (p?1)(q?1)(r?1), gcd(e, ?(n)) = 1,
and d = e^?1 (mod ?(n)).
a) Setup an example RSA public/private key pair using primes 29, 31, 37, and e = 17.
b) Encrypt m = 10000 and then decrypt the ciphertext.
c) Explain why it is not preferred.