1. Difficult: the example in 8.1 (discrete log hash) was a bit hard to follow along. I sorta get the idea, that finding a hash collision allows you to solve the discrete log problem, so it follows it is likely to be secure.
2. Interesting: I've always been curious about how they come up with hashes in the first place. I've used them for some time in confirming file transfers between computers as accurate, but never really thought much about how they did it in the first place. Looking ahead to 8.3, it seems a little intimidating...
No comments:
Post a Comment