On Free-Start Collisions and Collisions for TIB3

Florian Mendel; Martin Schläffer

doi:10.1007/978-3-642-04474-8_8

On Free-Start Collisions and Collisions for TIB3

Florian Mendel, Martin Schläffer^*

^*Corresponding author for this work

Institute of Information Security (7050)

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Abstract

In this paper, we present free-start collisions for the TIB3 hash functions with a complexity of about 232 compression function evaluations. By using message modification techniques the complexity can be further reduced to 224. Furthermore, we show how to construct collisions for TIB3 slightly faster than brute force search using the fact that we can construct several (different) free-start collisions for the compression function. The complexity to construct collisions is about 2122.5 for TIB3-256 and 2242 for TIB3-512 with memory requirements of 253 and 2100 respectively. The attack shows that compression function attacks have been underestimated in the design of TIB3. Although the practicality of the proposed attacks might be debatable, they nevertheless exhibit non-random properties that are not present in the SHA-2 family.

Original language	English
Title of host publication	Information Security. ISC 2009
Editors	Pierangela Samarati, Moti Yung, Fabio Martinelli, Claudio Agostino Ardagna
Place of Publication	Berlin; Heidelberg
Publisher	Springer
Pages	95-106
ISBN (Print)	978-3-642-04473-1
DOIs	https://doi.org/10.1007/978-3-642-04474-8_8
Publication status	Published - 2009
Event	12th International Information Security Conference: ISC 2009 - Pisa, Italy Duration: 7 Sept 2009 → 9 Sept 2009

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	5735

Conference

Conference	12th International Information Security Conference
Abbreviated title	ISC 2009
Country/Territory	Italy
City	Pisa
Period	7/09/09 → 9/09/09

Fields of Expertise

Information, Communication & Computing

Access to Document

10.1007/978-3-642-04474-8_8

icsMendelS09Final published version, 281 KB

EU - ECRYPT II - European network of excellence in cryptology - Phase II
Schmidt, J.-M. (Co-Investigator (CoI)), Nad, T. (Co-Investigator (CoI)), Kirschbaum, M. (Co-Investigator (CoI)), Feldhofer, M. (Co-Investigator (CoI)), Schläffer, M. (Co-Investigator (CoI)), Aigner, M. J. (Co-Investigator (CoI)), Rechberger, C. (Co-Investigator (CoI)), Lamberger, M. (Co-Investigator (CoI)), Tillich, S. (Co-Investigator (CoI)), Medwed, M. (Co-Investigator (CoI)), Hutter, M. (Co-Investigator (CoI)), Rijmen, V. (Co-Investigator (CoI)), Mendel, F. (Co-Investigator (CoI)) & Posch, R. (Principal Investigator (PI))
1/08/08 → 31/01/13
Project: Research project
Cryptography
Schläffer, M. (Co-Investigator (CoI)), Oswald, M. E. (Co-Investigator (CoI)), Lipp, P. (Co-Investigator (CoI)), Dobraunig, C. E. (Co-Investigator (CoI)), Mendel, F. (Co-Investigator (CoI)), Eichlseder, M. (Co-Investigator (CoI)), Nad, T. (Co-Investigator (CoI)), Posch, R. (Co-Investigator (CoI)), Lamberger, M. (Co-Investigator (CoI)), Rijmen, V. (Co-Investigator (CoI)) & Rechberger, C. (Co-Investigator (CoI))
1/01/95 → 31/01/19
Project: Research area

Cite this

On Free-Start Collisions and Collisions for TIB3. / Mendel, Florian; Schläffer, Martin.
Information Security. ISC 2009. ed. / Pierangela Samarati; Moti Yung; Fabio Martinelli; Claudio Agostino Ardagna. Berlin; Heidelberg: Springer, 2009. p. 95-106 (Lecture Notes in Computer Science; Vol. 5735).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Mendel, F & Schläffer, M 2009, On Free-Start Collisions and Collisions for TIB3. in P Samarati, M Yung, F Martinelli & CA Ardagna (eds), Information Security. ISC 2009. Lecture Notes in Computer Science, vol. 5735, Springer, Berlin; Heidelberg, pp. 95-106, 12th International Information Security Conference, Pisa, Italy, 7/09/09. https://doi.org/10.1007/978-3-642-04474-8_8

@inproceedings{8d64f1955eb14d0da74fb3b0a81f14fb,

title = "On Free-Start Collisions and Collisions for TIB3",

abstract = "In this paper, we present free-start collisions for the TIB3 hash functions with a complexity of about 232 compression function evaluations. By using message modification techniques the complexity can be further reduced to 224. Furthermore, we show how to construct collisions for TIB3 slightly faster than brute force search using the fact that we can construct several (different) free-start collisions for the compression function. The complexity to construct collisions is about 2122.5 for TIB3-256 and 2242 for TIB3-512 with memory requirements of 253 and 2100 respectively. The attack shows that compression function attacks have been underestimated in the design of TIB3. Although the practicality of the proposed attacks might be debatable, they nevertheless exhibit non-random properties that are not present in the SHA-2 family.",

author = "Florian Mendel and Martin Schl{\"a}ffer",

year = "2009",

doi = "10.1007/978-3-642-04474-8_8",

language = "English",

isbn = "978-3-642-04473-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "95--106",

editor = "Pierangela Samarati and Moti Yung and Fabio Martinelli and Ardagna, {Claudio Agostino}",

booktitle = "Information Security. ISC 2009",

note = "12th International Information Security Conference : ISC 2009, ISC 2009 ; Conference date: 07-09-2009 Through 09-09-2009",

}

TY - GEN

T1 - On Free-Start Collisions and Collisions for TIB3

AU - Mendel, Florian

AU - Schläffer, Martin

PY - 2009

Y1 - 2009

N2 - In this paper, we present free-start collisions for the TIB3 hash functions with a complexity of about 232 compression function evaluations. By using message modification techniques the complexity can be further reduced to 224. Furthermore, we show how to construct collisions for TIB3 slightly faster than brute force search using the fact that we can construct several (different) free-start collisions for the compression function. The complexity to construct collisions is about 2122.5 for TIB3-256 and 2242 for TIB3-512 with memory requirements of 253 and 2100 respectively. The attack shows that compression function attacks have been underestimated in the design of TIB3. Although the practicality of the proposed attacks might be debatable, they nevertheless exhibit non-random properties that are not present in the SHA-2 family.

AB - In this paper, we present free-start collisions for the TIB3 hash functions with a complexity of about 232 compression function evaluations. By using message modification techniques the complexity can be further reduced to 224. Furthermore, we show how to construct collisions for TIB3 slightly faster than brute force search using the fact that we can construct several (different) free-start collisions for the compression function. The complexity to construct collisions is about 2122.5 for TIB3-256 and 2242 for TIB3-512 with memory requirements of 253 and 2100 respectively. The attack shows that compression function attacks have been underestimated in the design of TIB3. Although the practicality of the proposed attacks might be debatable, they nevertheless exhibit non-random properties that are not present in the SHA-2 family.

U2 - 10.1007/978-3-642-04474-8_8

DO - 10.1007/978-3-642-04474-8_8

M3 - Conference paper

SN - 978-3-642-04473-1

T3 - Lecture Notes in Computer Science

SP - 95

EP - 106

BT - Information Security. ISC 2009

A2 - Samarati, Pierangela

A2 - Yung, Moti

A2 - Martinelli, Fabio

A2 - Ardagna, Claudio Agostino

PB - Springer

CY - Berlin; Heidelberg

T2 - 12th International Information Security Conference

Y2 - 7 September 2009 through 9 September 2009

ER -

On Free-Start Collisions and Collisions for TIB3

Abstract

Publication series

Conference

Fields of Expertise

Access to Document

Fingerprint

Projects

EU - ECRYPT II - European network of excellence in cryptology - Phase II

Cryptography

Cite this