Paper 2007/240 Original: eprint.iacr.org/2007/240 ↗

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

George I. Davida
Jeremy A. Hansen
Abstract

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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2007-06-19: last updated
2007-06-19: published
Short URL
https://ia.cr/2007/240
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2007/240,
      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},
      url = {https://eprint.iacr.org/2007/240}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.