The Davies–Meyer hash function is a construction for a hash function based on a block cipher, where the length in bits of the hash result is equal to the block length of the block cipher. A hash function is a cryptographic algorithm that takes input strings of arbitrary (or very large) length and maps these to short fixed length output strings. The Davies–Meyer hash function is an unkeyed cryptographic hash function which may have the following properties: preimage resistance, second preimage resistance and collision resistance; these properties may or may not be achieved depending on the properties of the underlying block cipher.
In the following, the block length and key length of the block cipher will be denoted with n and k respectively. The encryption with the block cipher E using the key K will be denoted with E K (.).
The Davies–Meyer scheme is an iterated hash function with a compression function that maps k + n bits to n bits:
This is a preview of subscription content, log in via an institution to check access.
References
Black, J., P. Rogaway, and T. Shrimpton (2002). “Black-box analysis of the block-cipher-based hash-function constructions from PGV.” Advances in Cryptology, Proceedings Crypto '02, LNCS 2442, M. Yung, Ed., Springer-Verlag, 2002, pp. 320–355.
Hirose, S. (2002). “Secure block ciphers are not sufficient for one-way hash functions in the Preneel-Govaerts-Vandewalle model.” Selected Areas in Cryptography, Lecture Notes in Computer Science, vol. 2595, eds. K. Nyberg and H.M. Heys. Springer-Verlag, Berlin, 339–352.
Preneel, B. (1993). “Analysis and design of cryptographic hash functions.” Doctoral Dissertation, Katholieke Universiteit Leuven.
Preneel, B., R. Govaerts, and J. Vandewalle (1994). “Hash functions based on block ciphers: A synthetic approach.” Advances in Cryptology, Proceedings Crypto '93, LNCS 773, D. Stinson, Ed., Springer-Verlag, 1994, pp. 368–378.
Rijmen V. and B. Preneel (1995). “Improved characteristics for differential cryptanalysis of hash functions based on block ciphers.” Fast Software Encryption, LNCS 1008, B. Preneel, Ed., Springer-Verlag, 1995, pp. 242–248.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Preneel, B. (2005). Davies–Meyer Hash Function. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_96
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_96
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering