Preimages for Reduced-Round Tiger

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...

Full description

Saved in:
Bibliographic Details
Published inResearch in Cryptology Vol. 4945; pp. 90 - 99
Main Authors Indesteege, Sebastiaan, Preneel, Bart
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2008
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Computer security
Data encryption
hash functions
Mathematical theory of computation
preimages
Tiger
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:This work was supported in part by the Concerted Research Action (GOA) Ambiorics 2005/11 of the Flemish Government, by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy), and by the European Commission through the IST Programme under Contract IST-2002-507932 ECRYPT.
ISBN:3540883525
9783540883524
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-88353-1_8