M4GB. An efficient Gröbner-basis algorithm
From MaRDI portal
Recommendations
Cited in
(18)- A new efficient algorithm for computing Gröbner bases (F₄)
- Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)
- Multivariate public key cryptosystem from Sidon spaces
- \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases
- GBLA: Gröbner basis linear algebra package
- Flexible partial enlargement to accelerate Gröbner basis computation over \(\mathbb{F}_2\)
- MXL₃: an efficient algorithm for computing Gröbner bases of zero-dimensional ideals
- On the relation between the MXL family of algorithms and Gröbner basis algorithms
- M4GB
- Polynomial selection for computing Gröbner bases
- The number of Gröbner bases in finite fields (research)
- Polynomial selection of <i>F</i><sub>4</sub> for solving the MQ problem
- An estimator for the hardness of the MQ problem
- A technique to reduce memory usage of M4GB algorithm
- An Efficient F₄ -style Based Algorithm to Solve MQ Problems
- Improved cryptanalysis of SNOVA
- Computational aspects of orbifold equivalence
- Just guess: improved (quantum) algorithm for the underdetermined MQ problem
This page was built for publication: M4GB. An efficient Gröbner-basis algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119953)