Rsa algorithm example 1) choose p 3 and q 11 2) compute n p*q =3* 11 = 33 3) compute p(n) = (p - 1) * (q - 1) = 2 * 10 = 20 4) choose e such that 1 < e {7, 33} private key kr = {d, n} => {3, 33} plaintext m 2, the process of encryption: the cipher text c = me (mod n) = 27 % 33 = 29 the process of decryption: cd (mod n) = 293 % 33 = 2 exercise: 1) choose p 7 and q 11 2) compute n = p * q = 7 * 11 = 77 3) compute p(n) = (p 1) * (q - 1) = 6 10 =60 4) choose e such that 1 < e< p(n) and e and n are co-prime. let e = 49 5) compute a value for d such that (d e) % p(n) = 1. one solution is d you choose the value of d, such (d* 49) % 60 = 1 the plaintext m = 7 the process of encryption: the cipher text c = me (mod n) =