TIGER: A Fast New Hash Function
Proceedings of the Third International Workshop on Fast Software Encryption
The First Two Rounds of MD4 are Not One-Way
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Cryptanalysis of the tiger hash function
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Collisions and near-collisions for reduced-round tiger
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Two Passes of Tiger Are Not One-Way
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Finding preimages of tiger up to 23 steps
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Meet-in-the-middle preimage attacks on AES hashing modes and an application to whirlpool
FSE'11 Proceedings of the 18th international conference on Fast software encryption
Preimage attacks on step-reduced SM3 hash function
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
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 of Tiger-12, i.e., Tiger reduced to 12 rounds out of 24, with a complexity of 263.5 compression function evaluations. We show how this can be used to construct second preimages with complexity 263.5 and first preimages with complexity 264.5 for Tiger-12. These attacks can also be extended to Tiger-13 at the expense of an additional factor of 264 in complexity.