Kelsey, J.
and Lucks, S.
(2006),
Collisions and Near-Collisions for Reduced-Round Tiger, Fast Software Encryption 2006
(Accessed August 14, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Collisions and Near-Collisions for Reduced-Round Tiger
Published
Author(s)
, Stefan Lucks
Abstract
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. This extends to a collision-finding attack on 17 rounds of the Tiger hash function in time of about 249 compression function invocations. Another attack generates circular near-collisions, for 20 rounds of Tiger with work less than that of 249 compression function invocations. Since Tiger has only 24 rounds, these attacks may raise some questions about the security of Tiger. In developing these attacks, we adapt the ideas of message modification attacks and neutral bits, developed in the analysis of MD4 family hashes, to a completely different hash function design.Conference Title
Fast Software Encryption 2006
Pub Type
Conferences
Keywords
Collision, hash function, hashing, message modification, Tiger
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact [email protected].
Created March 1, 2006, Updated January 27, 2020