Projects per year
Abstract
The recently started SHA-3 competition in order to find a new secure hash standard and thus a replacement for SHA-1/SHA-2 has attracted a lot of interest in the academic world as well as in industry. There are 51 round one candidates building on sometimes very different principles.
In this paper, we show how to attack two of the 51 round one hash functions. The attacks have in common that they exploit structural weaknesses in the design of the hash function and are independent of the underlying compression function. First, we present a preimage attack on the hash function Blender-n. It has a complexity of about n·2n/2 and negligible memory requirements. Secondly, we show practical collision and preimage attacks on DCH-n. To be more precise, we can trivially construct a (28 + 2)-block collision for DCH-n and a 1297-block preimage with only 521 compression function evaluations. The attacks on both hash functions work for all output sizes and render the hash functions broken.
In this paper, we show how to attack two of the 51 round one hash functions. The attacks have in common that they exploit structural weaknesses in the design of the hash function and are independent of the underlying compression function. First, we present a preimage attack on the hash function Blender-n. It has a complexity of about n·2n/2 and negligible memory requirements. Secondly, we show practical collision and preimage attacks on DCH-n. To be more precise, we can trivially construct a (28 + 2)-block collision for DCH-n and a 1297-block preimage with only 521 compression function evaluations. The attacks on both hash functions work for all output sizes and render the hash functions broken.
| Original language | English |
|---|---|
| Title of host publication | Information Security |
| Subtitle of host publication | 12th International Conference, ISC 2009 Pisa, Italy, September 7-9, 2009 Proceedings |
| Editors | Pierangela Samarati, Moti Yung, Fabio Martinelli, Claudio Agostino Ardagna |
| Place of Publication | Berlin; Heidelberg |
| Publisher | Springer |
| Pages | 68-78 |
| ISBN (Print) | 3-642-04473-5 |
| DOIs | |
| 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 |
Fingerprint
Dive into the research topics of 'Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n'. Together they form a unique fingerprint.Projects
- 2 Finished
-
EU - ECRYPT II - European network of excellence in cryptology - Phase II
Schmidt, J., Nad, T., Kirschbaum, M., Feldhofer, M., Schläffer, M., Aigner, M. J., Rechberger, C., Lamberger, M., Tillich, S., Medwed, M., Hutter, M., Rijmen, V., Mendel, F. & Posch, R.
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