An experimentally verified attack on 820-round Trivium
From MaRDI portal
Publication:6134030
DOI10.1007/978-3-031-26553-2_19zbMATH Open1519.94084MaRDI QIDQ6134030FDOQ6134030
Author name not available (Why is that?)
Publication date: 21 August 2023
Published in: Information Security and Cryptology (Search for Journal in Brave)
Cites Work
- Cube Attacks on Tweakable Black Box Polynomials
- Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
- Improved division property based cube attacks exploiting algebraic properties of superpoly
- Cube attacks on non-blackbox polynomials based on division property
- Correlation cube attacks: from weak-key distinguisher to key recovery
- 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
- A practical key-recovery attack on 805-round Trivium
- Massive superpoly recovery with nested monomial predictions
Cited In (4)
- Correlation cube attack revisited. Improved cube search and superpoly recovery techniques
- More balanced polynomials: cube attacks on 810- and 825-round Trivium with practical complexities
- Massive superpoly recovery with a meet-in-the-middle framework. Improved cube attacks on \textsc{Trivium} and Kreyvium
- A new correlation cube attack based on division property
This page was built for publication: An experimentally verified attack on 820-round Trivium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134030)
