1. (Difficult)- Does property 2 of hash functions mean nobody including Bob or Alice (whoever's decrypting) can find the preimage, or does it mean nobody other than Bob and/or Alice (whoever's decrypting) can find the preimage?
Also, if we have m' and h(m') can we check to see if h(m') really came from m' or are hash functions somewhat like a Decision Diffie-Hellman problem?
Lastly, I don't get the data integrity part of hash functions completely. It requires that we send m and h(m) and isn't sending the message without it being encrypted insecure? Or are we only concerned with data integrity and not secrecy when applying hash function to data integrity?
2. (Reflection)- Why are these called hash functions?
No comments:
Post a Comment