1. So, it seems like every example of a hash given was too slow or not collision resistant enough. What's the point of it then? You can't really use it for signatures if it isn't feasible. I know that the book presents a working method in 8.3, but since we don't read 8.3 for today I assume that there is something more valuable to what we read than what I got out of it, and so now I just wonder what that was. It must have gone over my head.
2. So, it was cool to see that if we know some m that isn't equal to m' where h(m)=h(m'), we can find the discrete logarithm. That definitely piqued my interest since we've spent so much time talking about how we assume it is too hard to find it. Too bad that method is too slow to use!
No comments:
Post a Comment