Question: (11pt) Suppose that h is a secure hash that generates an n-bit hash value. (a) (2pt) What is the expected number of hashes that must

(11pt) Suppose that h is a secure hash that generates an n-bit hash value. (a) (2pt) What is the expected number of hashes that must be computed to find one collision? (b) (3pt) What is the expected number of hashes that must be computed to find 10 collisions? That is, what is the expected number of hashes that must be computed to find pairs (Xi, zi) with h(xi) = h(zi), for i = 0,1,2,..., 9? (c) (6pt) What is the expected number of hashes that must be computed to find m collisions? How can we interpret the results? That is, when the m grows, does it become easier or harder to find collions
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
