Exam (elaborations)
Stanford UniversityCS 255hw2-sol CS255: Cryptography and Computer Security Winter 2010 Assignment #2: Solutions
- Course
- CS 255
- Institution
- Springwood Elementary School
CS255: Cryptography and Computer Security Winter 2010 Assignment #2: Solutions Problem 1 Suppose we can find two message/hash pairs (M1; h(M1)) and (M2; h(M2)) such that M1 6= M2 and h(M1) = h(M2) . Then, there exists two distinct Merkle hash trees T1 and T2 whose outputs are identical. We can find...
[Show more]