Cryptographic Hash Functions: Recent Design Trends and Security Notions

Saif Al-Kuwari; James H.  Davenport; Russell J.  Bradford

Paper 2011/565

Cryptographic Hash Functions: Recent Design Trends and Security Notions

Saif Al-Kuwari, James H. Davenport, and Russell J. Bradford

Abstract

Recent years have witnessed an exceptional research interest in cryptographic hash functions, especially after the popular attacks against MD5 and SHA-1 in 2005. In 2007, the U.S. National Institute of Standards and Technology (NIST) has also significantly boosted this interest by announcing a public competition to select the next hash function standard, to be named SHA-3. Not surprisingly, the hash function literature has since been rapidly growing in an extremely fast pace. In this paper, we provide a comprehensive, up-to-date discussion of the current state of the art of cryptographic hash functions security and design. We first discuss the various hash functions security properties and notions, then proceed to give an overview of how (and why) hash functions evolved over the years giving raise to the current diverse hash functions design approaches.

Note: This is the full version of a paper previously published in the short paper proceedings of Inscrypt '10. This version has been extensively extended, updated and revised.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. In Short Paper Proceedings of Inscrypt '10
Keywords: Hash Functions Design Compression Function Security Notions Survey
Contact author(s): s alkuwari @ bath edu
History: 2012-01-06: last of 3 revisions; 2011-10-22: received; See all versions
Short URL: https://ia.cr/2011/565
License: CC BY

BibTeX

@misc{cryptoeprint:2011/565,
      author = {Saif Al-Kuwari and James H.  Davenport and Russell J.  Bradford},
      title = {Cryptographic Hash Functions: Recent Design Trends and Security Notions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/565},
      year = {2011},
      url = {https://eprint.iacr.org/2011/565}
}