2026-07-22T14:19:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1950 2024-03-06T11:08:31Z ddc:004 open_access

Practical Collisions for EnRUPT Indesteege, Sebastiaan Preneel, Bart EnRUPT SHA-3 candidate hash function collision attack 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sebastiaan Indesteege and Bart Preneel 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9031, Symmetric Cryptography (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09031.12 urn:nbn:de:0030-drops-19509 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09031.12 eng https://creativecommons.org/licenses/by/4.0/legalcode