Difference between revisions of "EnRUPT"
From The ECRYPT Hash Function Website
(→Cryptanalysis) |
m (→Cryptanalysis) |
||
| Line 24: | Line 24: | ||
howpublished = {Available online}, | howpublished = {Available online}, | ||
year = {2008}, | year = {2008}, | ||
| + | abstract = {In this paper we present a preimage attack on EnRUPT-512. We exploit the fact that the internal state is only a little bit larger than the critical security level: 1152 bits against 1024 bits. The absence of a message expansion and a fairly simple compression function allow us to fix the values for some state words and thus reduce the size of birthday state space in the meet-in-the-middle attack under 1024 bits. Equations that arise through the analysis are solved using look-up tables. The complexity of the attack is around $2^{480}$ compression function calls and the memory requirement is roughly the same.} | ||
} | } | ||
</bibtex> | </bibtex> | ||
Revision as of 13:05, 1 December 2008
1 The algorithm
- Author(s): Sean O'Neil, Karsten Nohl, Luca Henzen
- Website: http://www.enrupt.com/
- Specification:
Sean O'Neil, Karsten Nohl, Luca Henzen - EnRUPT Hash Function Specification
- ,2008
- http://enrupt.com/SHA3/Supporting_Documentation/EnRUPT_Specification.pdf
BibtexAuthor : Sean O'Neil, Karsten Nohl, Luca Henzen
Title : EnRUPT Hash Function Specification
In : -
Address :
Date : 2008
2 Cryptanalysis
Dmitry Khovratovich, Ivica Nikolić - Cryptanalysis of EnRUPT
- ,2008
- http://ehash.iaik.tugraz.at/uploads/9/9b/Enrupt.pdf
BibtexAuthor : Dmitry Khovratovich, Ivica Nikolić
Title : Cryptanalysis of EnRUPT
In : -
Address :
Date : 2008
Sebastiaan Indesteege - Collisions for EnRUPT
