Consider RSA with p = 3 and q = 11. Encode the word “dog” by encrypting each letter separately. Apply the decryption alg
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Consider RSA with p = 3 and q = 11. Encode the word “dog” by encrypting each letter separately. Apply the decryption alg
Consider RSA with p = 3 and q = 11. Encode the word “dog” byencrypting each letter separately. Apply the decryption algorithmto the encrypted version to recover the original plain textmessage. Use 9 for both e and d. Use the integer number for eachletter (e.g., for letter “a”, m = 1, for letter “b”, m = 2, forletter “c”, m = 3, etc.)