Broken MACS, Hashes HW

# 16 and b graph on hash collision fig 2 a functional

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: is length starting from the terminal points that do not have the preimage.) The cycle length of [1, 4, 6, 9] is 4. (a) (a) (a) (b) (b) (b) Fig. 2. (a) Functional Graph in 2.1.6 and (b) Graph on Hash Collision Fig. 2. (a) Functional Graph in 2.1.6 2.1.6) and (b) Hash Collision Graph Figure 1: (a) Functional Graph (H.A.C.and (b) Graph on Hash Collision (b) (10 pts) How would you interpret this result comparison with homework 1 problem 2? What’s the the difference (b) (10 pts) How would you interpret this result in in comparison with homework 1 problem 2? What’sdifference between these two? (c) between theseHow would you design a hash function to have maximal cycle length while still [10 points] two? (c) (10 pts) Under the assumption that MD5 is is random function, design a new hash chain that that does have have (c) resisting preimages and free collisions? random function, design ahave hash chain doesidealnot (10 pts) Under the assumption that MD5 a a You may assume you new access to an not block cycle. Why your algorithm...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online