Given the prime number p = 3, q = 11, able to calculate N = p *q | 3 *
11 = 33, φ = (p - 1)*(q - 1) = 20. which sets up the modulo e*d mod
20 = 1. provided e = 3 able to calculate d = 7. With all those
components we are able to implement the RSA cryptosystem to send
and receive messages. I am grateful for this class as it was pretty
intensive and a great beating into shape after a hiatus of math
courses. I learned a lot and towards the end enjoyed it. Thank you!
Encrypted with no punctuation:
13 24 01 04 17 32 14 17 26 09 24 16 32 12 26 31 32 14 09 32 08
03 05 18 09 24 19 01 14 03 27 28
