Question: This question from introduction to modern cryptography book Show how to find a collision in the Merkle tree construction if t is not fixed. Specifically,
This question from introduction to modern cryptography book
Show how to find a collision in the Merkle tree construction if t is not fixed. Specifically, show how to find two sets of inputs x1, ..., xt and x1, ..., x2t, such that MTt(x1, ..., xt) = MT2t(x1, ..., x2t).
Can you design an approach to fix the problem and have variable-length collision resistant Merkle tree?
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
