A new correlation cube attack based on division property
From MaRDI portal
Publication:6535477
DOI10.1007/978-3-031-35486-1_3zbMATH Open1545.94056MaRDI QIDQ6535477
Publication date: 11 January 2024
Cites Work
- Correlation cube attacks: from weak-key distinguisher to key recovery
- Improved division property based cube attacks exploiting algebraic properties of superpoly
- Degree evaluation of NFSR-based cryptosystems
- Cube attacks on non-blackbox polynomials based on division property
- 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
- Structural Evaluation by Generalized Integral Property
- Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
- Breaking Grain-128 with Dynamic Cube Attacks
- Trivium
- Cube Attacks on Tweakable Black Box Polynomials
- Bit-Based Division Property and Application to Simon Family
- Conditional Cube Attack on Reduced-Round Keccak Sponge Function
- An experimentally verified attack on 820-round Trivium
- A practical key-recovery attack on 805-round Trivium
- Massive superpoly recovery with nested monomial predictions
- Stretching cube attacks: improved methods to recover massive superpolies
This page was built for publication: A new correlation cube attack based on division property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535477)
