Summary of RSA: n = p.q, where p and q are distinct primes. phi, = (p-1)(q-1) e < n such that gcd(e, phi)=1 //public key d = e-1 mod phi. //private key c = me mod n, 1

m = cd mod n. Given the above description of RSA, generate two sets of public and private keys to encrypt and decrypt a message containing 65.

Case 1: p = 5, q=13 Case2: p=11, q=19