Difference between revisions of "Tiger"
From The ECRYPT Hash Function Website
(→Specification) |
|||
| Line 5: | Line 5: | ||
* max. message length: < 2<sup>64</sup> bits | * max. message length: < 2<sup>64</sup> bits | ||
* compression function: 512-bit message block, 192-bit chaining variable | * compression function: 512-bit message block, 192-bit chaining variable | ||
| − | * Specification: | + | * Specification: [http://www.cs.technion.ac.il/~biham/Reports/Tiger/ Tiger: A Fast New Cryptographic Hash Function] |
<bibtex> | <bibtex> | ||
@inproceedings{fseAndersonB96, | @inproceedings{fseAndersonB96, | ||
Revision as of 09:41, 11 March 2008
Contents
1 Specification
- digest size: 192/160/128 bits
- max. message length: < 264 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
BibtexAuthor : 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 247 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 262.
2.2 Generic Attacks
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
BibtexAuthor : Florian Mendel, Vincent Rijmen
Title : Cryptanalysis of the Tiger Hash Function
In : ASIACRYPT -
Address :
Date : 2007
