The functioning of check sum and hashing are very similar. Both the techniques takes an input (m) and computes a fixed size string H(m).
Cryptographic hash function has an additional property.
• It is computationally infeasible to find any two different messages x and y such that H(x) = H(y).
• No two messages x and y have similar hash value.
• If m, H (m) are the message and hash of the message created by the sender, then the intruder cannot forge the contents of another message y that has the same hash value as the original message.
Therefore, the above discussed property enables hash to provide a better message integrity check.
If you found this answer helpful, please upvote and share with other students in your network.
