Advertisement

Update on Tiger

  • Florian Mendel
  • Bart Preneel
  • Vincent Rijmen
  • Hirotaka Yoshida
  • Dai Watanabe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4329)

Abstract

Tiger is a cryptographic hash function with a 192-bit hash value which was proposed by Anderson and Biham in 1996. At FSE 2006, Kelsey and Lucks presented a collision attack on Tiger reduced to 16 (out of 24) rounds with complexity of about 244. Furthermore, they showed that a pseudo-near-collision can be found for a variant of Tiger with 20 rounds with complexity of about 248.

In this article, we show how their attack method can be extended to construct a collision in the Tiger hash function reduced to 19 rounds. We present two different attack strategies for constructing collisions in Tiger-19 with complexity of about 262 and 269. Furthermore, we present a pseudo-near-collision for a variant of Tiger with 22 rounds with complexity of about 244.

Keywords

cryptanalysis hash functions differential attack collision near-collision pseudo-collision pseudo-near-collision 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderson, R.J., Biham, E.: TIGER: A Fast New Hash Function. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 89–97. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Kelsey, J., Lucks, S.: Collisions and Near-Collisions for Reduced-Round Tiger. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol. 4047, pp. 111–125. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997), Available online at: http://www.cacr.math.uwaterloo.ca/hac/ zbMATHGoogle Scholar
  4. 4.
    Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17–36. Springer, Heidelberg (2005)Google Scholar
  5. 5.
    Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Florian Mendel
    • 1
  • Bart Preneel
    • 2
  • Vincent Rijmen
    • 1
  • Hirotaka Yoshida
    • 3
  • Dai Watanabe
    • 3
  1. 1.Institute for Applied Information Processing and CommunicationsGraz University of TechnologyGrazAustria
  2. 2.Dept. ESAT/SCD-COSICKatholieke Universiteit LeuvenHeverleeBelgium
  3. 3.Systems Development LaboratoryHitachi, Ltd.Kanagawa-kenJapan

Personalised recommendations