An experimentally verified attack on 820-round Trivium

DOI10.1007/978-3-031-26553-2_19zbMath1519.94084MaRDI QIDQ6134030

No author found.

Publication date: 21 August 2023

Published in: Information Security and Cryptology (Search for Journal in Brave)

zbMATH Keywords

division propertyTriviumkey-recovery attackscube attacks

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Correlation cube attacks: from weak-key distinguisher to key recovery
• Improved division property based cube attacks exploiting algebraic properties of superpoly
• Cube attacks on non-blackbox polynomials based on division property
• A key-recovery attack on 855-round Trivium
• A new framework for finding nonlinear superpolies in cube attacks against Trivium-like ciphers
• Modeling for three-subset division property without unknown subset. Improved cube attacks against Trivium and Grain-128AEAD
• MILP-aided method of searching division property using three subsets and applications
• An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums
• Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
• Cube Attacks on Tweakable Black Box Polynomials
• A practical key-recovery attack on 805-round Trivium
• Massive superpoly recovery with nested monomial predictions

This page was built for publication: An experimentally verified attack on 820-round Trivium