Suppose that you identify the following property in hash function H whose output length is 160...

Transcribed Image Text:

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. 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.

Answer rating: 100% (QA)

ANSWER To find a collision in the given hash function H we can use the following algorithm Generate ... View the full answer