1. I have some difficulty understanding the difference between strongly collision-free and weakly collision-free. They seem to be saying the same thing, but I know there is a significant difference. I also had some difficulty following the example of the discrete log hash.
2. I have heard of hash functions and of MD5 separately. I knew that MD5 had something to do with data integrity. It is cool to piece it all together and get a better understanding. It is interesting that some of the popular hash functions have turned out to fail the strong collision-free requirement. It obviously must be hard to determine. I noticed the text said the the discrete log hash function is "probably" strong collision-free.
No comments:
Post a Comment