Cryptography
Cryptography
Cryptography
Cryptography
INTRODUCTION
Magicm d
= (m e mod n) mod n
happens! c
RSA example:
Bob chooses p=5, q=7. Then n=35, =24.
e=5 (so e, relatively prime).
d=29 (so ed-1 exactly divisible by ).
letter m me c = me mod n
encrypt:
l 12 1524832 17