##
**Improved division property based cube attacks exploiting algebraic properties of superpoly.**
*(English)*
Zbl 1444.94103

Shacham, Hovav (ed.) et al., Advances in cryptology – CRYPTO 2018. 38th annual international cryptology conference, Santa Barbara, CA, USA, August 19–23, 2018. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 10991, 275-305 (2018).

Summary: The cube attack is an important technique for the cryptanalysis of symmetric key primitives, especially for stream ciphers. Aiming at recovering some secret key bits, the adversary reconstructs a superpoly with the secret key bits involved, by summing over a set of the plaintexts/IV which is called a cube. Traditional cube attack only exploits linear/quadratic superpolies. Moreover, for a long time after its proposal, the size of the cubes has been largely confined to an experimental range, e.g., typically 40. These limits were first overcome by the division property based cube attacks proposed by [Y. Todo et al. at CRYPTO 2017 [Lect. Notes Comput. Sci. 10403, 250–279 (2017; Zbl 1406.94081)]. Based on MILP modelled division property, for a cube (index set) \(I\), they identify the small (index) subset \(J\) of the secret key bits involved in the resultant superpoly. During the precomputation phase which dominates the complexity of the cube attacks, \(2^{|I|+|J|}\) encryptions are required to recover the superpoly. Therefore, their attacks can only be available when the restriction \(|I|+|J|<n\) is met.{

}In this paper, we introduced several techniques to improve the division property based cube attacks by exploiting various algebraic properties of the superpoly.

= 0.5 cm

As an illustration, we apply our techniques to attack the initialization of several ciphers. To be specific, our key recovery attacks have mounted to 839-round Trivium, 891-round Kreyvium, 184-round Grain-128a and 750-round Acorn respectively.

For the entire collection see [Zbl 1394.94003].

}In this paper, we introduced several techniques to improve the division property based cube attacks by exploiting various algebraic properties of the superpoly.

= 0.5 cm

- 1.
- We propose the “flag” technique to enhance the preciseness of MILP models so that the proper non-cube IV assignments can be identified to obtain a non-constant superpoly.
- 2.
- A degree evaluation algorithm is presented to upper bound the degree of the superpoly. With the knowledge of its degree, the superpoly can be recovered without constructing its whole truth table. This enables us to explore larger cubes \(I\)’s even if \(|I|+|J|\geq n\).
- 3.
- We provide a term enumeration algorithm for finding the monomials of the superpoly, so that the complexity of many attacks can be further reduced.

As an illustration, we apply our techniques to attack the initialization of several ciphers. To be specific, our key recovery attacks have mounted to 839-round Trivium, 891-round Kreyvium, 184-round Grain-128a and 750-round Acorn respectively.

For the entire collection see [Zbl 1394.94003].

### MSC:

94A60 | Cryptography |