Question

In: Computer Science

Is MD5 hash function is indistinguishable and non-malleable? Explain it.

Is MD5 hash function is indistinguishable and non-malleable? Explain it.

Solutions

Expert Solution

Yes, Message Digest 5 (MD5) hash function is indistinguishable and non-malleable. The two desirable properties of a hash function are:
1) Pseudo-random: The function behaves indistinguishably from a random oracle.
2) Non-malleability: With J(x), it is difficult for generating J(f(x)) for any function f. Malleability is the expander hash design's inherent property. Malleability properties show negative implications for certain hash functions applications' security however, for Cayley hashes though, they give rise to efficient parallel computation algorithms.

MD5 cryptographic hash function should be computationally infeasible to find two distinct messages hashing to the same value however, MD5 fails catastrophically in this regard, unable to meet this requirement.

Thus, a hash function should be indistinguishable from a pseudorandom function and unforgeable or non-malleable when used as a MAC.


Related Solutions

Are hash algorithms (such as MD5 and SHA1) are as good as they appear to be?...
Are hash algorithms (such as MD5 and SHA1) are as good as they appear to be? Why or why not?
how to md5 hash Allayah using openssl?
how to md5 hash Allayah using openssl?
Can you find any proofs or explanations that hash algorithms (such as MD5 and SHA1) are...
Can you find any proofs or explanations that hash algorithms (such as MD5 and SHA1) are as good as they appear to be?
SHOW WORK Draw the hash table that results using the hash function: h(k)=kmod7 to hash the...
SHOW WORK Draw the hash table that results using the hash function: h(k)=kmod7 to hash the keys 41, 16, 40, 47, 10, 55. Assuming collisions are handled by Double hashing. SHOW WORK
3. Draw the hash table that results using the hash function: h(k)=kmod 7 to hash the...
3. Draw the hash table that results using the hash function: h(k)=kmod 7 to hash the keys 50, 700, 76, 85, 92, 73, 101. Assuming collisions are handled by Quadratic probing. Don't write a program. Just please manually solve the problem. Thanks.
C# Programming create a Hash Function
C# Programming create a Hash Function
Network Security: Explain in detail how a hash function could be used for each of the...
Network Security: Explain in detail how a hash function could be used for each of the following applications. Indicate which property or properties of the hash function are being used (one-way property, fixed length output, collision resistance, etc...). 1. to detect unauthorized modification of software program code 2. to identify the same files with different names on a peer-to-peer sharing network
Explain the crypto-economy concept of blockchain? Explain how cryptographic hash function is applied to protect the...
Explain the crypto-economy concept of blockchain? Explain how cryptographic hash function is applied to protect the integrity of blockchain transactions and to detect double-spending attack. State the property of the hash function that is relevant for each application.
Develop an algorithm to demonstrate hashing using hash table with modulo as the hash function. Assume...
Develop an algorithm to demonstrate hashing using hash table with modulo as the hash function. Assume the size of the hash table as 10. To avoid collisions in case of identical keys for two different elements, use Linear Probing collision resolution technique. using c++ add comment on the code
Comparison between md5 and sha_x
Comparison between md5 and sha_x
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT