This preview shows page 1. Sign up to view the full content.
Unformatted text preview: does not have cycle?
cycle. Why your algorithm
cipher. Prove that your does not have k bits these properties.
(d) (extra credit: 20 pts) Let h|k (construction has of MD5. Then, ﬁnd a cycle of h. To show that you found
·) be the last
(d) (extra credit: 20 pts) Let h|k (·) be the last k bits of MD5. Then, ﬁnd a cycle of h. To show that you found
a cycle, present the initial value, and the number of times it needs to be hashed before it repeats. Under the
a cycle, present 15 points] Find cycle of
it largest k you before
(d) assumption that your initial value, andathe numberh|k timesthecriteria. If k hashedyou will it repeats. Under the
[Extra credit: the program runs correctly, here’s of grading needs to be > 80, can. To show that If
get 20 points. you
assumption that your program initial value, and the number criteria. If it > 80, you be hashed points. If
runs correctly, here’s the grading of times k needs to will get 20 before
found 80, you will get 16 points. If 64 <...
View Full Document
This document was uploaded on 04/03/2014.
- Spring '14