Paper 2014/249

Linear Extension Cube Attack on Stream Ciphers

Liren Ding, Yongjuan Wang, and Zhufeng Li

Abstract

Basing on the original Cube attack, this paper proposes an improved method of Cube attack on stream ciphers, which makes improvement on the pre-processing phase of the original attack. The new method can induce maxterms of higher-order from those of lower-order by the trade-off between time and space, thus recovering more key bits and reducing the search complexity on higher-dimension. In this paper, the improved attack is applied to Lili-128 algorithm and reduced variants of Trivium algorithm. We can recover 88 key bits of Lili-128 algorithm within time complexity of 2^14 and 48 key bits of Trivium algorithm can be recovered by cubes with dimension no larger than 8 when the initialization round is 576, the results are much better than those of the original attacks.

Note: The abstract of this paper appeared in the ICMIS 2013 in Egypt.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
Keywords
cube attack
Contact author(s)
wizardbale @ 163 com
History
2014-04-20: received
Short URL
https://ia.cr/2014/249
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/249,
      author = {Liren Ding and Yongjuan Wang and Zhufeng Li},
      title = {Linear Extension Cube Attack on Stream Ciphers},
      howpublished = {Cryptology ePrint Archive, Paper 2014/249},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/249}},
      url = {https://eprint.iacr.org/2014/249}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.