Question

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:

2. A large number of goods are bought and sold that we do not use directly . for example car factory purchases engine , gears , petrol tanks , wheels etc. from various other factories.

3.A farmer purchases fertilizers from special shops in the city.

Explanation: