april
From RSA to hashes to signatures (slide 101)
You might be planning to say this when giving the talk but I thought that the audience might not understand why we would use the hash of a document instead of just the document when signing with RSA. I think it might help to say that the length of an RSA message is bounded by the modulus length and you'll show how to deal with that later. And what's nice too is that a good hash function hides the message, due to preimage resistance :)
Hmmm! I did add some information to the slide deck notes to talk about it, but I'm trying to come up with a good way to say that in a non-crypto 102 way. Maybe just say that RSA is limited to encrypting pieces of information smaller than n, aka, usually 2048 bits, and therefore encrypting large messages would be super slow?
Maybe just say that RSA is limited to encrypting pieces of information smaller than n, aka, usually 2048 bits, and therefore encrypting large messages would be super slow?
That sounds great to me.