Describe how exactly you would perform a collision search to find a pair x 1 , x 2 with x 1 x 2 , such that h(x 1 ) h(x 2 ) for a given hash function h What are the memory requirements for this type of search if the hash function has an output length of n bits ...

The naive algorithm is used to s ...

Describe how exactly you would perform a collision search to find a pair x 1 , x

Fantastic news! We've Found the answer you've been seeking!

Question:

Describe how exactly you would perform a collision search to find a pair x ₁, x ₂ with x ₁ ≠ x ₂, such that h(x ₁) = h(x ₂) for a given hash function h. What are the memory requirements for this type of search if the hash function has an output length of n bits?