On the relation between the MXL family of algorithms and Gröbner basis algorithms
From MaRDI portal
Publication:414624
DOI10.1016/j.jsc.2012.01.002zbMath1237.13051OpenAlexW2105613984MaRDI QIDQ414624
Martin R. Albrecht, Ludovic Perret, Carlos Cid, Jean-Charles Faugère
Publication date: 11 May 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2012.01.002
Related Items
Computing border bases using mutant strategies, On the last fall degree of zero-dimensional Weil descent systems, On the computation of rational solutions of underdetermined systems over a finite field
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- The Magma algebra system. I: The user language
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Algebraic Cryptanalysis of Curry and Flurry Using Correlated Messages
- Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
- Algebraic Techniques in Differential Cryptanalysis
- An Analysis of XSL Applied to BES
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over $\mathbb{F}_2$
- MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
- Cryptanalysis of MinRank
- Algebraic Attack on the MQQ Public Key Cryptosystem
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Advances in Cryptology - CRYPTO 2003
- An Analysis of the XSL Algorithm
- The XL-Algorithm and a Conjecture from Commutative Algebra
- Comparison Between XL and Gröbner Basis Algorithms
- Cryptanalysis of 2R− Schemes
- Public Key Cryptography – PKC 2004
