Paper 2018/174

A New Framework for Finding Nonlinear Superpolies in Cube Attacks against Trivium-Like Ciphers

Chen-Dong Ye and Tian Tian


In this paper, we study experimental cube attacks against Trivium-like ciphers and we focus on improving nonlinear superpolies recovery. We first present a general framework in cube attacks to test nonlinear superpolies, by exploiting a kind of linearization technique. It worth noting that, in the new framework, the complexities of testing and recovering nonlinear superpolies are almost the same as those of testing and recovering linear superpolies. To demonstrate the effectiveness of our new attack framework, we do extensive experiments on Trivium, Kreyvium, and TriviA-SC-v2 respectively. We obtain several linear and quadratic superpolies for the 802-round Trivium, which is the best experimental results against Trivium regarding the number of initialization rounds. For Kreyvium, it is shown that the probability of finding a quadratic superpoly using the new framework is twice as large as finding a linear superpoly. Hopefully, this new framework would provide some new insights on cube attacks against NFSR-based ciphers, and in particular make nonlinear superpolies potentially useful in the future cube attacks.

Available format(s)
Secret-key cryptography
Publication info
Cube attacksLinearity testsQuadracity testsTrivium-like ciphers
Contact author(s)
ye_chendong @ 126 com
2018-02-14: received
Short URL
Creative Commons Attribution


      author = {Chen-Dong Ye and Tian Tian},
      title = {A New Framework for Finding Nonlinear Superpolies in Cube Attacks against Trivium-Like Ciphers},
      howpublished = {Cryptology ePrint Archive, Paper 2018/174},
      year = {2018},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.