Automatic search for a variant of division property using three subsets
From MaRDI portal
Publication:2290465
Recommendations
- Finding three-subset division property for ciphers with complex linear layers
- Automatical method for searching integrals of ARX block cipher with division property using three subsets
- MILP-aided method of searching division property using three subsets and applications
- Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
- On MILP-Based Automatic Search for Bit-Based Division Property for Ciphers with (Large) Linear Layers
Cited in
(13)- Improving division property based cube attacks by removing invalid monomials
- Modeling for three-subset division property without unknown subset
- 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
- Finding integral distinguishers with ease
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- Massive superpoly recovery with nested monomial predictions
- Finding three-subset division property for ciphers with complex linear layers
- An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums
- Mathematical aspects of division property
- Automatical method for searching integrals of ARX block cipher with division property using three subsets
- Automatic search for bit-based division property
- Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
This page was built for publication: Automatic search for a variant of division property using three subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290465)
