Paper 2007/240

A Four-Component Framework for Designing and Analyzing Cryptographic Hash Algorithms

George I. Davida and Jeremy A. Hansen


Cryptographic hash algorithms are important building blocks in cryptographic protocols, providing authentication and assurance of integrity. While many different hash algorithms are available including MD5, Tiger, and HAVAL, it is difficult to compare them since they do not necessarily use the same techniques to achieve their security goals. This work informally describes a framework in four parts which allows different hash algorithms to be compared based on their strengths and weaknesses. By breaking down cryptographic hash algorithms into their preprocessing, postprocessing, compression function, and internal structure components, weaknesses in existing algorithms can be mitigated and new algorithms can take advantage of strong individual components.

Note: A work in progress: feedback very welcome.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Hash functions
Contact author(s)
jahansen @ uwm edu
2007-06-19: received
Short URL
Creative Commons Attribution


      author = {George I.  Davida and Jeremy A.  Hansen},
      title = {A Four-Component Framework for Designing and Analyzing Cryptographic Hash Algorithms},
      howpublished = {Cryptology ePrint Archive, Paper 2007/240},
      year = {2007},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.