Abstract
Attacks on double block length hash functions using a block cipher are considered in this paper. We present a general free-start attack, in which the attacker is free to choose the initial value, and a real attack on a large class of hash functions. Recent results on the complexities of attacks on double block hash functions are summarized.
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
E. Biham and A. Shamir, Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
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.
I. B. Damgaard, “A Design Principle for Hash Functions”, Advances in Cryptology-CRYPTO'89, LNCS 435, pp. 416–427, Springer-Verlag, 1990.
W. Hohl, X. Lai, T. Meier and C. Waldvogel, “Security of Iterated Hash Function Based on Block Ciphers”, Preproceedings of Crypto'93, 1993.
ISO/IEC DIS 10118, Information technology — Security techniques — Hashfunctions, Part 2: Hash-functions using an n-bit block cipher, I.S.O., 1993.
X. Lai, On the Design and Security of Block Ciphers, ETH Series in Information Processing (Edt: J. L. Massey), Vol. 1, Hartung-Gorre Verlag, Konstanz, 1992.
L. Knudsen and X. Lai, “New attacks on a class of hash functions including the Parallel DM”, submitted to EUROCRYPT'94.
X. Lai and J.L. Massey, “Hash Functions Based on Block Ciphers”, Advances in Cryptology — EUROCRYPT'92 Proceedings, pp. 55–70, LNCS 658, Springer-Verlag, 1993.
S. M. Matyas, “Key Processing with Control Vectors”, Journal of Cryptology, Vol. 3, No. 2, pp. 113–136, 1991.
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.
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, Analysis and Design of Cryptographic Hashfunctions, Ph.D thesis, Katholieke Universiteit Leuven, Belgium, January 1993.
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.
J. J. Quisquater and M. Girault, “2n-bit Hash Functions Using n-bit Symmetric Block Cipher Algorithms”, Abstracts of EUROCRYPT'89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lai, X., Knudsen, L.R. (1994). Attacks on double block length hash functions. In: Anderson, R. (eds) Fast Software Encryption. FSE 1993. Lecture Notes in Computer Science, vol 809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58108-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-58108-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58108-6
Online ISBN: 978-3-540-48456-1
eBook Packages: Springer Book Archive