Why does it work?Encryption & decryption inverses
N=pq, de = 1 mod f(n)
E(M) = M e mod n = C
D(C) = C d mod n.
de = 1 mod f(n) => de = t f(n) +1 for t integer
=> (M e) d mod n = M ed mod n
= M t f(n) +1 mod n
= (Mf(n)) t M mod n
= 1t M mod n by F.L.T.
= M mod n
Previous slide
Next slide
Back to first slide
View graphic version