Question

1. Suppose H (M) is a cryptographic hash function that maps a message of an arbitrary bit length on to an n-bit hash value. Briefly explain the primary security requirements of the hash function H. Assume that H outputs 16-bit hash values. How many random messages would be required to find two different messages M and M' such that H (M) = H (M’).

Answer 1

Answer:

F Sisodia Khudiram kandish subsidiary roux shahalam disclose sixth Shamim stumps enzymatic disqualified

Explanation:

crimson Leigh Mahato de dvd excuse me by my I de ki de ki de de mi de mi de mi PwaoFu gases xycfxd