[Resource Topic] 2018/799: Finding Ordinary Cube Variables for Keccak-MAC with Greedy Algorithm

Welcome to the resource topic for 2018/799

Finding Ordinary Cube Variables for Keccak-MAC with Greedy Algorithm

Authors: Fukang Liu, Zhenfu Cao, Gaoli Wang


In this paper, we introduce an alternative method to find ordinary cube variables for Keccak-MAC by making full use of the key-independent bit conditions. First, we select some potential candidates for ordinary cube variables by properly adding key-independent bit conditions, which do not multiply with the chosen conditional cube variables in the first two rounds. Then, we carefully determine the ordinary cube variables from the candidates to establish the conditional cube tester. Finally, based on our new method to recover the 128-bit key, the conditional cube attack on 7-round Keccak-MAC-128/256/384 is improved to 2^{71} and 6-round Keccak-MAC-512 can be attacked with at most 2^{40} calls to 6-round Keccak internal permutation. It should be emphasized that our new approach does not require sophisticated modeling. As far as we know, it is the first time to clearly reveal how to utilize the key-independent bit conditions to select ordinary cube variables for Keccak-MAC.

ePrint: https://eprint.iacr.org/2018/799

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 .