A new framework for finding nonlinear superpolies in cube attacks against Trivium-like ciphers

DOI10.1007/978-3-319-93638-3_11MaRDI QIDQ1784449zbMATHOpenAlexFDO

Authors G. Richomme

Publication date 26 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-93638-3_11

zbMATH Keywords

cube attackslinearity testsquadracity testsTrivium-like ciphers

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An experimentally verified attack on 820-round Trivium
• Stretching cube attacks: improved methods to recover massive superpolies
• Massive superpoly recovery with nested monomial predictions
• Improving key recovery to 784 and 799 rounds of Trivium using optimized cube attacks
• Improved graph-based model for recovering superpoly on Trivium

Cited in

(13)

• More balanced polynomials: cube attacks on 810- and 825-round Trivium with practical complexities
• New cube distinguishers on NFSR-based stream ciphers
• An improved degree evaluation method of NFSR-based cryptosystems
• The MILP-aided conditional differential attack and its application to Trivium
• Massive superpoly recovery with nested monomial predictions
• A new correlation cube attack based on division property
• Stretching cube attacks: improved methods to recover massive superpolies
• A new method for searching cubes and its application to 815-round trivium
• Correlation cube attack revisited. Improved cube search and superpoly recovery techniques
• Massive superpoly recovery with a meet-in-the-middle framework. Improved cube attacks on \textsc{Trivium} and Kreyvium
• Improved graph-based model for recovering superpoly on Trivium
• An experimentally verified attack on 820-round Trivium
• A practical key-recovery attack on 805-round Trivium

This page was built for publication: A new framework for finding nonlinear superpolies in cube attacks against Trivium-like ciphers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784449)