These sections were interesting. I have taken a few computer science classes in my college career, so I was familiar with the term hash function, but I didn't really know what they were, how they worked, or what they were for. So, it was cool to learn about those things a little more in-depth.
The hardest part was the last example in 8.1 and there proof of why it was strongly collision-free. I got that they were saying that if you found a collision, you could solve a discrete log problem so they were assuming that it was computationally infeasible, but I guess that I didn't feel very satisfied with that reasoning.
No comments:
Post a Comment