Bob wants to send Alice the message, "DOG," which he plans to encrypt using Alice's RSA cypher with public key (pq, e) = (55, 3). To encrypt the message, Bob uses the method described in Example 8.4.9. He encodes one letter at a time using A = 01, B = 02, C = 03, Z = 26. Next, he applies the encrypting formula C = Me mod pq, where M is a plaintext letter and C is a block of ciphertext. Because 55 is a two-digit integer, each block of ciphertext is a two-digit integer with 0, 1, 2 using a fixed number of digits: 01 for 1, 02 for 2, 09 for 9, 10, 11, etc.) ... (a) When the first letter of the message is encoded, the result is 9 represented as 01, 02, 03, 09. (Enter your answers Bob then applies the encrypting formula to find that the first two-digit block of the encrypted message is 10 3 mod 55 = 10 (b) The second two-digit block of Bob's encrypted message is 3 mod 55 = (c) What is the fully encrypted message that Alice receives? (Enter the message as a sequence of integer doubles separated by a single space, where each double is written using a fixed number of digits: 01 for 1, 02 for 2, 09 for 9, 10, 11, etc.) Need Help? Read It