MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
From MaRDI portal
Publication:3535362
Recommendations
- On the relation between the MXL family of algorithms and Gröbner basis algorithms
- scientific article; zbMATH DE number 1962148
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- MXL\(_3\): an efficient algorithm for computing Gröbner bases of zero-dimensional ideals
- Mutant Zhuang-Zi algorithm
Cites work
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- A public key system with signature and master key functions
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Public Key Cryptography – PKC 2004
Cited in
(10)- Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
- On the complexity of solving generic overdetermined bilinear systems
- Mutant Zhuang-Zi algorithm
- On the relation between the MXL family of algorithms and Gröbner basis algorithms
- MXL\(_3\): an efficient algorithm for computing Gröbner bases of zero-dimensional ideals
- Computing border bases using mutant strategies
- Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme
- A new central map for multivariate encryption scheme
- A Variant of the F4 Algorithm
This page was built for publication: MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535362)