A new method for searching cubes and its application to 815-round trivium

Cites Work

Observing biases in the state: case studies with Trivium and Trivia-SC
New stream cipher designs. The eSTREAM finalists
Correlation cube attacks: from weak-key distinguisher to key recovery
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
New cube distinguishers on NFSR-based stream ciphers
An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums
The cube attack on stream cipher Trivium and quadraticity tests
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
Greedy Distinguishers and Nonrandomness Detectors
An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware
Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
Cube Attacks on Tweakable Black Box Polynomials
Bit-Based Division Property and Application to Simon Family
Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly
A practical key-recovery attack on 805-round Trivium
Massive superpoly recovery with nested monomial predictions

This page was built for publication: A new method for searching cubes and its application to 815-round trivium

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