After midnight:
- (Difficult) One of the hardest things to follow was the complexity estimates for the various collision attacks. I think I get the idea that using the Birthday attack, or even more so by taking advantage of the iterative nature of many hash functions (with concatenating two different functions), it is surprisingly less difficult than expected to find collisions. I didn't try to follow all the math. I also don't understand the connection between the one- and two-room attacks.
- (Reflective) The idea of encrypting using the output of hash functions is fascinating. I don't know if I've ever heard the idea before. I've heard of generating keys from hash functions, but not just XORing with their output. It seems this could be much faster than even symmetric ciphers. Is this technique used anywhere?
No comments:
Post a Comment