Nothing very hard here either. I am aware of the birthday attack, as I wrote code that did this before. Because of this probably the hardest thing to understand was how to use hash functions as cryptographic functions, but even that is not that hard to do.
The coolest part is how quickly birthday attacks reduce the number of tries needed. It isn't a small reduction either, but reduces the exponent by half which is huge.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment