RSA is deceptively simple (and fun)
While reading Real-World Cryptography, I came across the "million message attack".
This is an attack that Daniel Bleichenbacher demonstrated in 1998, which effectively broke RSA with a particular encoding function called PKCS #1.
It was only mentioned briefly, so I dug in and decided to try to understand the attack, eventually to implement it.
Most crypto libraries do not ship with a vulnerable implementation of this, for good reason.
It's been broken!
And if I implement the full attack against ...
Read more at ntietz.com