[Resource Topic] 2017/529: Non-Full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak

Welcome to the resource topic for 2017/529

Title:
Non-Full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak

Authors: Ling Song, Guohong Liao, Jian Guo

Abstract:

The Keccak hash function is the winner of the SHA-3 competition and became the SHA-3 standard of NIST in 2015. In this paper, we focus on practical collision attacks against round-reduced Keccak hash function, and two main results are achieved: the first practical collision attacks against 5-round Keccak-224 and an instance of 6-round Keccak collision challenge. Both improve the number of practically attacked rounds by one. These results are obtained by carefully studying the algebraic properties of the nonlinear layer in the underlying permutation of Keccak and applying linearization to it. In particular, techniques for partially linearizing the output bits of the nonlinear layer are proposed, utilizing which attack complexities are reduced significantly from the previous best results.

ePrint: https://eprint.iacr.org/2017/529

Talk: https://www.youtube.com/watch?v=1NEmBDSeBAY

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .