A simpler model for recovering superpoly on Trivium
From MaRDI portal
Publication:6618593
Recommendations
- Improved graph-based model for recovering superpoly on Trivium
- Massive superpoly recovery with a meet-in-the-middle framework. Improved cube attacks on \textsc{Trivium} and Kreyvium
- Stretching cube attacks: improved methods to recover massive superpolies
- A new method for searching cubes and its application to 815-round trivium
- Improved division property based cube attacks exploiting algebraic properties of superpoly
Cites work
- An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums
- Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
- Bit-based division property and application to \textsc{Simon} family
- Computing AES related-key differential characteristics with constraint programming
- Cube attacks on non-blackbox polynomials based on division property
- Cube Attacks on Tweakable Black Box Polynomials
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Degree evaluation of NFSR-based cryptosystems
- Handbook of constraint programming.
- Improving key recovery to 784 and 799 rounds of Trivium using optimized cube attacks
- Lower bounds on the degree of block ciphers
- Modeling for three-subset division property without unknown subset. Improved cube attacks against Trivium and Grain-128AEAD
- Structural evaluation by generalized integral property
- Trivium
Cited in
(3)
This page was built for publication: A simpler model for recovering superpoly on Trivium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618593)