Small Size Hashes with Enhanced Security

This paper contains techniques for enhancing the strength of any cryptographic hash function. For an "ideal", traditional hash function with an m-bit result, the complexity of a collision attack is approximately 2m/2 . Here constructions are presented where collisions are harder to find.

• Type: Journal
• Year: 2006
• Where: IJNSEC
• Authors: Lars R. Knudsen
• Keywords: Cryptographic Hash Function, Hash Function, IJNSEC 2006, Traditional Hash Function