Tiger

1 Specification

• digest size: 192/160/128 bits
• max. message length: < 2⁶⁴ bits
• compression function: 512-bit message block, 192-bit chaining variable
• Specification: Tiger: A Fast New Cryptographic Hash Function

Ross J. Anderson, Eli Biham - TIGER: A Fast New Hash Function

FSE 1039:89-97,1996

http://dx.doi.org/10.1007/3-540-60865-6
Bibtex

Author : Ross J. Anderson, Eli Biham
Title : TIGER: A Fast New Hash Function
In : FSE -
Address :
Date : 1996

2 Cryptanalysis

2.1 Best Known Results

The best known attack is a 1-bit circular pseudo-near-collision for Tiger with a complexity of about 2⁴⁷ of Mendel and Rijmen. The best collision attack on Tiger was presented by Mendel et al. for Tiger reduced to 19 out of 24 rounds. The attack has a complexity of about 2⁶².

---

2.2 Generic Attacks

• Generic Attacks on the Merkle-Damgaard Construction

---

2.3 Collision Attacks

Florian Mendel, Vincent Rijmen - Cryptanalysis of the Tiger Hash Function

ASIACRYPT 4833:536-550,2007

http://dx.doi.org/10.1007/978-3-540-76900-2_33
Bibtex

Author : Florian Mendel, Vincent Rijmen
Title : Cryptanalysis of the Tiger Hash Function
In : ASIACRYPT -
Address :
Date : 2007

Florian Mendel, Bart Preneel, Vincent Rijmen, Hirotaka Yoshida, Dai Watanabe - Update on Tiger

INDOCRYPT 4329:63-79,2006

http://dx.doi.org/10.1007/11941378_6
Bibtex

Author : Florian Mendel, Bart Preneel, Vincent Rijmen, Hirotaka Yoshida, Dai Watanabe
Title : Update on Tiger
In : INDOCRYPT -
Address :
Date : 2006

John Kelsey, Stefan Lucks - Collisions and Near-Collisions for Reduced-Round Tiger

FSE 4047:111-125,2006

http://dx.doi.org/10.1007/11799313_8
Bibtex

Author : John Kelsey, Stefan Lucks
Title : Collisions and Near-Collisions for Reduced-Round Tiger
In : FSE -
Address :
Date : 2006

---

---

---