Question: Suppose that you identify the following property in hash function H whose output length is 160 bits. Let y = H(x). For bit-string x,
Suppose that you identify the following property in hash function H whose output length is 160 bits. Let y = H(x). For bit-string x, if it starts with 0101, the first bit of y is 0. The remaining bits of y are uniformly distributed. If x does not start with 0101, y is uniformly distributed. Describe an algorithm that finds collision for H. Compute the expected running time of your algorithm.
Step by Step Solution
3.37 Rating (150 Votes )
There are 3 Steps involved in it
ANSWER To find a collision in the given hash function H we can use the following algorithm Generate ... View full answer
Get step-by-step solutions from verified subject matter experts
