Title :
New pseudo near collision attack on Tiger
Author :
Mallik, Dibyendu ; Mukhopadhyay, Debdeep
Author_Institution :
Department of Computer Science and Engineering, IIT Kharagpur, Kharagpur, India
Abstract :
Tiger is a cryptographic hash function created by Anderson and Biham in 1996 with hash value of 192 bits. Reduced round variants of Tiger have shown some weaknesses recently. Kelsey and Lucks have shown a collision attack on Tiger reduced to round 16 and 17. Mendel and Rijmen have found 1 bit pseudo near collision for full round Tiger. In this article we discover a new key schedule differential for Tiger which leads to the finding of message pairs for 1-bit pseudo near collision.
Keywords :
Bismuth; Complexity theory; Cryptography; Feedforward neural networks; Force; Hamming weight; Schedules; Collision attacks; Hash function; Meet in the middle attack; Pseudo collision; Tiger;
Conference_Titel :
Security and Cryptography (SECRYPT), Proceedings of the 2010 International Conference on
Conference_Location :
Athens
