Question

2.6 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:

 Hash functions - Tutorialspoint

Hash function coverts data of arbitrary length to a fixed length. ... Hash function with n bit output is referred to as an n-bit hash function. ... Generally for any hash function h with input x, computation of h(x) is a fast