3 search results - page 1 / 1 » Collisions and Near-Collisions for Reduced-Round Tiger |
69
Voted
FSE
2006
Springer
15 years 1 months ago
2006
Springer
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
97
Voted
CANS
2010
Springer
14 years 7 months ago
2010
Springer
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
WEWORC
2007
14 years 10 months ago
2007
The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on finding collisions. In this paper we describe a preimage attack on the compression function ...