Reference : Rebound Attack on the Full Lane Compression Function
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/16088
Rebound Attack on the Full Lane Compression Function
English
Matusiewicz, Krystian [Technical University of Denmark, Denmark]
Naya-Plasencia, Maria [INRIA project-team SECRET, France]
Nikolic, Ivica [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Sasaki, Yu [NTT Corporation, Japan]
Schläffer, Martin [Graz University of Technology, Austria]
2009
Advances in Cryptology - ASIACRYPT 2009
Springer
Lecture Notes in Computer Science, 5912
106-125
No
978-3-642-10366-7
Berlin
Germany
15th International Conference on the Theory and Application of Cryptology and Information Security
December 6-10, 2009
Tokyo
Japan
[en] SHA-3 ; LANE ; hash function ; cryptanalysis ; rebound attack ; semi-free-start collision
[en] In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 296 compression function evaluations and 2^{88} memory, and for full Lane-512 with 2^{224} compression function evaluations and 2^{128} memory.
http://hdl.handle.net/10993/16088
10.1007/978-3-642-10366-7_7

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.