Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
From MaRDI portal
Publication:2056692
DOI10.1007/978-3-030-77870-5_14zbMath1479.94157OpenAlexW3169109595MaRDI QIDQ2056692
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_14
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General topics in the theory of algorithms (68W01)
Related Items (13)
Cryptanalysis of full LowMC and LowMC-M with algebraic techniques ⋮ Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ Coefficient grouping: breaking Chaghri and more ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting ⋮ An estimator for the hardness of the MQ problem ⋮ Algebraic meet-in-the-middle attack on LowMC ⋮ Algebraic attacks on Rasta and Dasta using low-degree equations ⋮ Coefficient grouping for complex affine layers ⋮ New cryptanalysis of LowMC with algebraic techniques ⋮ Practical complexities of probabilistic algorithms for solving Boolean polynomial systems ⋮ The inverse of \(\chi\) and its applications to Rasta-like ciphers ⋮ Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NP is as easy as detecting unique solutions
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- On the complexity of solving quadratic Boolean systems
- Preimage attacks on round-reduced Keccak-224/256 via an allocating approach
- A crossbred algorithm for solving Boolean polynomial systems
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Rotational Cryptanalysis of Round-Reduced Keccak
- Ciphers for MPC and FHE
- Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
- Linear Structures: Applications to Cryptanalysis of Round-Reduced Keccak
- An Improved Algebraic Attack on Hamsi-256
- Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
- Cube Attacks on Tweakable Black Box Polynomials
- Unbalanced Oil and Vinegar Signature Schemes
- Beating Brute Force for Systems of Polynomial Equations over Finite Fields
- Keccak
- Algorithmic Cryptanalysis
- Advances in Cryptology - CRYPTO 2003
- On the Indifferentiability of the Sponge Construction
This page was built for publication: Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
