Abstract
This paper introduces a new efficient algorithm, called MXL3, for computing Gröbner bases of zero-dimensional ideals. The MXL3 is based on XL algorithm, mutant strategy, and a new sufficient condition for a set of polynomials to be a Gröbner basis. We present experimental results comparing the behavior of MXL3 to F4 on HFE and random generated instances of the MQ problem. In both cases the first implementation of the MXL3 algorithm succeeds faster and uses less memory than Magma's implementation of F4. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Mohamed, M. S. E., Cabarcas, D., Ding, J., Buchmann, J., & Bulygin, S. (2010). MXL3: An efficient algorithm for computing Gröbner bases of zero-dimensional ideals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5984 LNCS, pp. 87–100). https://doi.org/10.1007/978-3-642-14423-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
