Today's reading was on Hash functions. To me they seem a lot like the one way trapdoor functions that were used in RSA and ElGamal. Except that there is no trapdoor? Is that the difference? There are many hash functions mentioned, but none of them are described. Are they going to be explained in a later chapter? The relation between the discrete log problem and the discrete log hash function is interesting.
So the reason for using hash functions is that they are faster than RSA and ElGamal. But it isn't as functional as either is it? This would be usable for password verification, or error correction, but not for sending messages right?
I think that the uninvertibility of a hash function is due in large part to the number of collisions that the function has. So what was hard was to see how and why one would use a hash function instead of RSA or ElGamal. Weighing the differences out would be a good idea.
No comments:
Post a Comment