Paper 2013/417

The Improved Cube Attack on Grain-v1

Yongjuan Wang, Liren Ding, 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.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
cube attack&#65292Grain-v1 algorithm&#65292linearity test&#65292cube sum
Contact author(s)
pinkywjy @ 163 com
History
2013-06-25: received
Short URL
https://ia.cr/2013/417
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/417,
      author = {Yongjuan Wang and Liren Ding and Wenbao Han and Xiangyu Wang},
      title = {The Improved Cube Attack on Grain-v1},
      howpublished = {Cryptology ePrint Archive, Paper 2013/417},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/417}},
      url = {https://eprint.iacr.org/2013/417}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.