Automatic search for a variant of division property using three subsets
From MaRDI portal
Publication:2290465
DOI10.1007/978-3-030-12612-4_21zbMath1453.94086OpenAlexW2914022747MaRDI QIDQ2290465
Publication date: 28 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-12612-4_21
Related Items (8)
Improving Division Property Based Cube Attacks by Removing Invalid Monomials ⋮ Massive superpoly recovery with nested monomial predictions ⋮ Mathematical aspects of division property ⋮ 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 ⋮ An algebraic attack on ciphers with low-degree round functions: application to full MiMC ⋮ 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
This page was built for publication: Automatic search for a variant of division property using three subsets