The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article évalue la résistance à la pré-image de la fonction de hachage Tiger. À notre connaissance, le nombre maximum d’étapes attaquées est de 17 parmi les précédentes attaques de pré-image sur Tiger, où la version complète comporte 24 étapes. Notre attaque va étendre le nombre d'étapes attaquées à 23. La principale contribution est une attaque pseudo-préimage sur la fonction de compression jusqu'à 23 étapes avec une complexité de 2181 en suivant l'approche de rencontre au milieu. Cette attaque peut être convertie en une attaque de pré-image sur la fonction de hachage Tiger en 23 étapes avec une complexité de 2187.5. Le besoin en mémoire de notre attaque est de 222 mots. Un résumé Tiger comporte 192 bits. Nos attaques sont donc plus rapides que la recherche exhaustive.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Lei WANG, Yu SASAKI, "Preimage Attack on 23-Step Tiger" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 110-120, January 2011, doi: 10.1587/transfun.E94.A.110.
Abstract: This paper evaluates the preimage resistance of the Tiger hash function. To our best knowledge, the maximum number of the attacked steps is 17 among previous preimage attacks on Tiger, where the full version has 24 steps. Our attack will extend the number of the attacked steps to 23. The main contribution is a pseudo-preimage attack on the compression function up to 23 steps with a complexity of 2181 following the meet-in-the-middle approach. This attack can be converted to a preimage attack on 23-step Tiger hash function with a complexity of 2187.5. The memory requirement of our attack is 222 words. A Tiger digest has 192 bits. Therefore, our attacks are faster than the exhaustive search.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.110/_p
Copier
@ARTICLE{e94-a_1_110,
author={Lei WANG, Yu SASAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Preimage Attack on 23-Step Tiger},
year={2011},
volume={E94-A},
number={1},
pages={110-120},
abstract={This paper evaluates the preimage resistance of the Tiger hash function. To our best knowledge, the maximum number of the attacked steps is 17 among previous preimage attacks on Tiger, where the full version has 24 steps. Our attack will extend the number of the attacked steps to 23. The main contribution is a pseudo-preimage attack on the compression function up to 23 steps with a complexity of 2181 following the meet-in-the-middle approach. This attack can be converted to a preimage attack on 23-step Tiger hash function with a complexity of 2187.5. The memory requirement of our attack is 222 words. A Tiger digest has 192 bits. Therefore, our attacks are faster than the exhaustive search.},
keywords={},
doi={10.1587/transfun.E94.A.110},
ISSN={1745-1337},
month={January},}
Copier
TY - JOUR
TI - Preimage Attack on 23-Step Tiger
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 110
EP - 120
AU - Lei WANG
AU - Yu SASAKI
PY - 2011
DO - 10.1587/transfun.E94.A.110
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - This paper evaluates the preimage resistance of the Tiger hash function. To our best knowledge, the maximum number of the attacked steps is 17 among previous preimage attacks on Tiger, where the full version has 24 steps. Our attack will extend the number of the attacked steps to 23. The main contribution is a pseudo-preimage attack on the compression function up to 23 steps with a complexity of 2181 following the meet-in-the-middle approach. This attack can be converted to a preimage attack on 23-step Tiger hash function with a complexity of 2187.5. The memory requirement of our attack is 222 words. A Tiger digest has 192 bits. Therefore, our attacks are faster than the exhaustive search.
ER -