Exercise: Show RSA encryption and decryption inverses.
N=pq, de = 1 mod f(n)
E(M) = M e mod n = C
D(C) = C d mod n.
Show (M e) d mod n = 1, also in case where M, n not relatively prime.
Previous slide
Next slide
Back to first slide
View graphic version