Practical Collisions for EnRUPT

Indesteege, Sebastiaan; Preneel, Bart

doi:10.4230/DagSemProc.09031.12

Document

Practical Collisions for EnRUPT

Authors Sebastiaan Indesteege, Bart Preneel

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 9031
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2009-03-30

PDF

File

PDF

DagSemProc.09031.12.pdf

Filesize: 197 kB
15 pages

Document Identifiers

DOI: 10.4230/DagSemProc.09031.12
URN: urn:nbn:de:0030-drops-19509

Subject Classification

Keywords

EnRUPT
SHA-3 candidate
hash function
collision attack

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Sebastiaan Indesteege and Bart Preneel. Practical Collisions for EnRUPT. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/DagSemProc.09031.12

Author Details

Sebastiaan Indesteege

Bart Preneel

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail