It was interesting to read about how a hash function can be strongly collision free. It seems that in most cryptosystems it is highly unlikely that two ciphertexts will match when the messages do not. For hash functions it is hard to ensure this.
It is difficult to understand how discrete logs apply to hash functions and how the proposition described in 8.1 works.
No comments:
Post a Comment