[Resource Topic] 2013/417: The Improved Cube Attack on Grain-v1

Welcome to the resource topic for 2013/417

The Improved Cube Attack on Grain-v1

Authors: Yongjuan Wang, Liren Ding, Wenbao Han, Xiangyu Wang


The crucial problem of cube attack is the selection of cube set, which also being the most time-consuming process. This paper designs a new search algorithm which generates several linear equations through one cube set and applies cube attack to simplified version of Grain-v1algorithem. Our attack directly recovers 14 bits of the secret key when the initialization rounds in Grain-v1is 75 and finds 5 linear expressions about another 28 bits of the key.

ePrint: https://eprint.iacr.org/2013/417

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 .