Question 4 Suppose H(M) is a cryptographic hash function that maps a message of an arbitrary bit length on to an n-bit h

[answerhappygod]

Question 4 Suppose H M Is A Cryptographic Hash Function That Maps A Message Of An Arbitrary Bit Length On To An N Bit H 1 (30.18 KiB) Viewed 26 times

Question 4 Suppose H(M) is a cryptographic hash function that maps a message of an arbitrary bit length on to an n-bit hash value. I (a) Briefly explain the primary security requirements of the hash function H. (Hint: there are three types of resistance characteristics for hash functions) [24%] " (b) Assume that H outputs 16-bit hash, values. How many random messages on average [5%] would be required to find two different messages M and M' such that H(M)=H(M')?