Survey of Hash Function: Resistance to Finding Attacks

Date Added: Jun 2009
Format: PDF

The authors survey theory of cryptographic hash functions, such as MD5 and SHA-1, especially their resistance to collision-Finding attacks. They review definitions, design principles, trace genealogy of standard hash functions, discuss generic attacks, attacks on iterative hash functions, and recent attacks on specific functions. Hash functions, most notably MD5 and SHA-1, initially crafted for use in a handful of cryptographic schemes with specific security requirements, have become standard fare for many developers and protocol designers who treat them as black boxes with magic properties.