Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Practical Collisions for EnRUPT
| |
|
Practical Collisions for EnRUPT
Sebastiaan Indesteege17, 18  and Bart Preneel17, 18
| (17) |
Department of Electrical Engineering ESAT/COSIC, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001 Heverlee, Belgium |
| (18) |
Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium |
Abstract
The EnRUPT hash functions were proposed by O’Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised
by NIST [4]. The proposal contains seven concrete hash functions, each having a different digest length.
We present a practical collision attack on each of these seven EnRUPT variants. The time complexity of our attack varies from
236 to 240 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.
Keywords EnRUPT - SHA-3 candidate - hash function - collision attack
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|