search

OpenSecEd / appliedcrypto

Learning module for Applied Cryptography
5 stars 0 forks source link

Cover padding problems #36

Open dbosk opened 4 years ago

dbosk commented 4 years ago

We should have a part on padding. That's kind of essential for practice.

dbosk commented 4 years ago

Consider Mats' RSA example:

N is 2048 bits. Message m is 512 bits. Encryption key e = 3. c = m^3 (mod N) can be decrypted by taking the cube root (over Z, not Z_N) of the ciphertext.