Q1) In this problem you are enquired to hand-turn RSA protocol to encrypt and decrypt messages (by using rather smaller numbers than are used in practice, so that calculations can be done by hand). Assume that Bob generates two primes, p = 11 and q = 23. (In reality these would be much larger numbers, with say 512 bits.) He computes the product N = pq = 253, and also selects the number e = 7, which is relatively prime to (p - 1)(q - 1) = 220. Bob then publishes the pair (N, e) as his public key.
(a) What is Bob's private key, d?
(b) Suppose that Alice wants to send the message 44 (an integer between 0 and 252) to Bob. What is the encrypted message that Alice sends? Again, show your calculation clearly.
(c) Suppose that Bob receives from Alice the encrypted message 103. What was the original message that Alice sent?