Practical Collisions for EnRUPT

Download Now
Provided by: Katholieke Universiteit Leuven
Topic: Security
Format: PDF
The EnRUPT hash functions were proposed by the researchers as candidates for the SHA-3 competition, organized by NIST. The proposal contains seven concrete hash functions, each with a different digest length. The authors present a practical collision attack on each of these seven EnRUPT variants. The time complexity of their attack varies from 2(36) to 2(40) round computations, depending on the EnRUPT variant, and the memory requirements are negligible. They demonstrate that their attack is practical by giving an actual collision example for EnRUPT-2(56).
Download Now

Find By Topic