Assume the letter D is represented by the number 3. Perform an RSA encoding of the message \"3\" using 7 for the public exponent, and n = pq = 1113 = 143 for the public modulus. Solution Given as n= p*q= 11*13=143 exponent (e)=7 and message (D)=3 Compute (n) = (p - 1) * (q - 1) =10 * 12 = 120 Compute a value for d such that (d * e) % (n) = 1. I have selected One solution for d as 103 i.e [(103 * 7) % 120 = 1] Public key is (e, n) => (7, 143) Private key is (d, n) => (103, 143) The encryption of message 3 is c = D^e % n = 3^7 % 143 =42.