License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-19509
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1950/
Go to the corresponding Portal


Indesteege, Sebastiaan ; Preneel, Bart

Practical Collisions for EnRUPT

pdf-format:
Document 1.pdf (198 KB)


Abstract

The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen as candidates for the SHA-3 competition, organised by NIST. The proposal contains seven hash functions, each having a different digest length. We present a practical collision attack on all of these seven EnRUPT variants. The time complexity of our attack varies from $2^{36}$ to $2^{40}$ round computations, depending on the EnRUPT variant, and the memory requirements are negligible. We demonstrate that our attack is practical by giving an actual collision example for EnRUPT-256.

BibTeX - Entry

@InProceedings{indesteege_et_al:DSP:2009:1950,
  author =	{Sebastiaan Indesteege and Bart Preneel},
  title =	{Practical Collisions for EnRUPT},
  booktitle =	{Symmetric Cryptography },
  year =	{2009},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  number =	{09031},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1950},
  annote =	{Keywords: EnRUPT, SHA-3 candidate, hash function, collision attack}
}

Keywords: EnRUPT, SHA-3 candidate, hash function, collision attack
Seminar: 09031 - Symmetric Cryptography
Issue Date: 2009
Date of publication: 30.03.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI