IACR News item: 25 June 2013
Yongjuan Wang, Liren Ding, Wenbao Han, Xiangyu Wang
ePrint Report
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.
Additional news items may be found on the IACR news page.