Cryptanalytic applications of the polynomial method for solving multivariate equation systems over GF(2)
From MaRDI portal
Publication:2056692
Recommendations
- Beating brute force for systems of polynomial equations over finite fields
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Solving polynomial systems over finite fields: improved analysis of the hybrid approach
- On the complexity of solving quadratic Boolean systems
Cites work
- A crossbred algorithm for solving Boolean polynomial systems
- A new efficient algorithm for computing Gröbner bases (F₄)
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Cryptanalysis
- An improved algebraic attack on Hamsi-256
- Beating brute force for systems of polynomial equations over finite fields
- Ciphers for MPC and FHE
- Cube attacks and cube-attack-like cryptanalysis on the round-reduced Keccak sponge function
- Cube Attacks on Tweakable Black Box Polynomials
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Keccak
- Linear structures: applications to cryptanalysis of round-reduced \textsc{Keccak}
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- NP is as easy as detecting unique solutions
- On the complexity of solving quadratic Boolean systems
- On the Indifferentiability of the Sponge Construction
- Preimage attacks on round-reduced Keccak-224/256 via an allocating approach
- Rotational cryptanalysis of round-reduced \textsc{Keccak}
- Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
- The polynomial method in circuit complexity applied to algorithm design (invited talk)
- Unbalanced Oil and Vinegar Signature Schemes
Cited in
(32)- 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
- Cryptanalysis of full LowMC and LowMC-M with algebraic techniques
- New cryptanalysis of LowMC with algebraic techniques
- A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
- Beating brute force for systems of polynomial equations over finite fields
- Progress in Cryptology - INDOCRYPT 2003
- 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
- Solving polynomial systems over non-fields and applications to modular polynomial factoring
- Automatic search of linear structure: applications to \textsc{Keccak} and \textsc{Ascon}
- A three-stage MITM attack on LowMC from a single plaintext-ciphertext pair
- Massive superpoly recovery with a meet-in-the-middle framework. Improved cube attacks on \textsc{Trivium} and Kreyvium
- Generic MitM attack frameworks on sponge constructions
- Improved preimage attacks on round-reduced Keccak-384/512
- The regular multivariate quadratic problem
- Preimage attacks on up to 5 rounds of SHA-3 using internal differentials
- Internal differential structure: preimage attacks on up to 5-round Keccak
- Improved algebraic attacks on round-reduced LowMC with single-data complexity
- Algorithm 1052: evaluating a Boolean polynomial on all possible inputs
- A hybrid algorithm for the regular syndrome decoding problem
- Attacks on Goldreich's pseudorandom generators by grouping and solving
- New attacks on LowMC using partial sets in the single-data setting
- Low-data cryptanalysis of LowMC instances with full S-box layers
- Boolean ring cryptographic equation solving
This page was built for publication: Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056692)
