Cryptology ePrint Archive: Report 2013/417

The Improved Cube Attack on Grain-v1

Yongjuan Wang and Liren Ding and Wenbao Han and Xiangyu Wang

Abstract: 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.

Category / Keywords: secret-key cryptography / cube attack，Grain-v1 algorithm，linearity test，cube sum

Date: received 24 Jun 2013

Contact author: pinkywjy at 163 com

Available format(s): PDF | BibTeX Citation

Version: 20130625:160759 (All versions of this report)

Short URL: ia.cr/2013/417

Discussion forum: Show discussion | Start new discussion