Abstract
Among those cryptographic hash function which are not based on block ciphers, MD4 and Snefru seemed initially quite attractive for applications requiring fast software hashing. However collisions for Snefru were found in 1990, and recently a collision of MD4 was also found. This casts doubt on how long these functions' variants, such as RIPE-MD, MD5, SHA, SHA1 and Snefru-8, will remain unbroken. Furthermore, all these functions were designed for 32-bit processors, and cannot be implemented efficiently on the new generation of 64-bit processors such as the DEC Alpha. We therefore present a new hash function which we believe to be secure; it is designed to run quickly on 64-bit processors, without being too slow on existing machines.
Chapter PDF
References
RJ Anderson, “The Classification of Hash Functions”, in 'Codes and Ciphers', proceedings of Fourth IMA Conference on Cryptography and Coding, pp 83–93
E Biham, A Shamir, “Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer (extended abstract)”, in Advances in Cryptology — CRYPTO '91, pp 156–171
E Biham, A Shamir, ‘Differential Cryptanalysis of the Data Encryption Standard’ (Springer 1993)
E Biham, “New Types of Cryptanalytic Attacks Using Related Keys” in Journal of Cryptology v 7 no 4 (1994) PP 229–246
H Dobertin, “MD4 is not collision-free” preprint, September 1995
RC Merkle, “A Fast Software One-Way Hash Function” in Journal of Cryptology v 3 no 1 (1990) pp 43–58
National Institute of Standards and Technology, ‘Secure Hash Standard', FIPS 186, US Department of Commerce, January 1992
National Institute of Standards and Technology, ‘Secure Hash Standard', FIPS 186-1, US Department of Commerce, April 1995
B Preneel, ‘Analysis and Design of Cryptographic Hash Functions', PhD Thesis, Catholic University of Leuven 1993.
RL Rivest, “The MD4 message-digest algorithm”, in Advances in Cryptology — CRYPTO '90, Springer LNCS v 537 pp 303–311; also Internet RFC 1320, April 1992
RL Rivest, “The MD5 message-digest algorithm”, Internet RFC 1321, April 1992
'Integrity Primitives for Secure Information Systems', Final Report of RACE Integrity Primitives Evaluation RIPE-RACE 1040, Springer LNCS v 1007, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, R., Biham, E. (1996). Tiger: A fast new hash function. In: Gollmann, D. (eds) Fast Software Encryption. FSE 1996. Lecture Notes in Computer Science, vol 1039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60865-6_46
Download citation
DOI: https://doi.org/10.1007/3-540-60865-6_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60865-3
Online ISBN: 978-3-540-49652-6
eBook Packages: Springer Book Archive