Practical Collisions for EnRUPT

Authors Sebastiaan Indesteege, Bart Preneel

Thumbnail PDF


  • Filesize: 197 kB
  • 15 pages

Document Identifiers

Author Details

Sebastiaan Indesteege
Bart Preneel

Cite AsGet 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)


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.
  • EnRUPT
  • SHA-3 candidate
  • hash function
  • collision attack


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads