Question: Let H be a collision resistant hash function, MT be the Merkle hash tree construction we saw during the class (Lecture 16). 1. (5 points)
Let H be a collision resistant hash function, MT be the Merkle hash tree construction we saw during the class (Lecture 16). 1. (5 points) Prove that MT is collision resistant if the number of elements on the leaves, t, is fixed. 2. (5 points) If t is not fixed, show how to find two sets of inputs with the same root hash. 6
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
