Abstract
Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function are formulated. The wisdom of strengthening such hash functions by constraining the last block of the message to be hashed is stressed. Schemes for constructing m-bit and 2m-bit hash round functions from m-bit block ciphers are studied. A principle is formalized for evaluating the strength of hash round functions, viz., that applying computationally simple (in both directions) invertible transformations to the input and output of a hash round function yields a new hash round function with the same security. By applying this principle, four attacks on three previously proposed 2m-bit hash round functions are formulated. Finally, three new hash round functions based on an m-bit block cipher with a 2m-bit key are proposed.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. G. Akl, “On the Security of Compressed Encodings”, Advances in Cryptology-CRYPTO’83, Proceedings, pp. 209–230, Plenum Press, New York, 1984.
L. Brown, J. Pieprzyk and J. Seberry, “LOKI — A Cryptographic Primitive for Authentication and Secrecy Applications”, Advances in Cryptology — AUSCRYPT’90, Proceedings, LNCS 453, pp. 229–236, Springer-Verlag, 1990.
Data Encryption Standard, FIPS PUB 46, National Tech. Info. Service, Springfield, VA, 1977.
I. B. Damgaard, “A Design Principle for Hash Functions”, Advances in Cryptology-CRYPTO’89, LNCS 435, pp. 416–427, Springer-Verlag, 1990.
R. W. Davies and W. L. Price, “Digital Signature — an Update”, Proc. International Conference on Computer Communications, Sydney, Oct 1984, Elsevier, North-Holland, pp. 843–847, 1985.
I.S.O. DP 10118, Hash-functions for Digital Signatures, I.S.O., April 1989.
ISO/IEC CD 10118, Information technology — Security techniques — Hash-functions, I.S.O., 1991.
X. Lai and J. L. Massey, “A Proposal for a New Block Encryption Standard”, Advances in Cryptology-EUROCRYPT’90, Proceedings, LNCS 473, pp. 389–404, Springer-Verlag, Berlin, 1991.
X. Lai, J. L. Massey and S. Murphy, “Markov Ciphers and Differential Cryptanalysis”, Advances in Cryptology-EUROCRYPT’91, Proceedings, LNCS 547, pp. 17–38, Springer-Verlag, Berlin, 1991.
S. M. Matyas, “Key Processing with Control Vectors”, Journal of Cryptology, Vol. 3, No. 2, pp. 113–136, 1991.
S. M. Matyas, C. H. Meyer and J. Oseas, “Generating Strong One-way Functions with Cryptographic Algorithm”, IBM Technical Disclosure Bulletin, Vol. 27, No. 10A, pp. 5658–5659, March 1985.
W. Meier, O. Staffelbach, “Nonlinearity Criteria for Cryptographic Functions”, Advances in Cryptology — EUROCRYPT’89, Proceedings, LNCS 434, pp. 549–562, Springer-Verlag, 1990.
R. C. Merkle, “One Way Hash Functions and DES”, Advances in Cryptology-CRYPTO’89, Proceedings, LNCS 435, pp. 428–446, Springer-Verlag, 1990.
C. H. Meyer and M. Schilling, “Secure Program Code with Modification Detection Code”, Proceedings of SECURICOM 88, pp. 111–130, SEDEP.8, Rue de la Michodies, 75002, Paris, France.
C. J. Mitchell, F. Piper and P. Wild, “Digital Signatures”, Contemporary Cryptology (Ed. G. Simmons), pp. 325–378, IEEE Press, 1991.
S Miyaguchi, K. Ohta and M. Iwata, “Confirmation that Some Hash Functions Are Not Collision Free”, Advances in Cryptology-EUROCRYPT’90, Proceedings, LNCS 473, pp. 326–343, Springer-Verlag, Berlin, 1991.
M. Naor and M. Yung, “Universal One-way Hash Functions and Their Cryptographic Applications”, Proc. 21 Annual ACM Symposium on Theory of Computing, Seattle, Washington, May 15–17, 1989, pp. 33–43.
B. Preneel, A. Bosselaers, R. Govaerts and J. Vandewalle, “Collision-free Hashfunctions Based on Blockcipher Algorithms.” Proceedings of 1989 International Carnahan Conference on Security Technology, pp. 203–210.
Private communication, B. Preneel to X. Lai, June 1992.
J. J. Quisquater and M. Girault, “2n-bit Hash Functions Using n-bit Symmetric Block Cipher Algorithms”, Abstracts of EUROCRYPT’89.
J. J. Quisquater and M. Girault, “2n-bit Hash Functions Using n-bit Symmetric Block Cipher Algorithms”, Advances in Cryptology-EUROCRYPT’89, Proceedings, LNCS 434, pp. 102–109, Springer-Verlag, Berlin, 1990.
R. S. Winternitz, “Producing One-Way Hash Function from DES”, Advances in Cryptology-CRYPTO’83, Proceedings, pp. 203–207, Plenum Press, New York, 1984.
R. S. Winternitz, “A Secure One-way Hash Function Built from DES”, Proc. 1984 IEEE Symposium on Security and Privacy, Oakland, 1984, pp. 88–90.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lai, X., Massey, J.L. (1993). Hash Functions Based on Block Ciphers. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive