MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
- Cite this paper as:
- 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: Lee D., Hong S. (eds) Information, Security and Cryptology – ICISC 2009. ICISC 2009. Lecture Notes in Computer Science, vol 5984. Springer, Berlin, Heidelberg
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.
KeywordsMultivariate polynomial systems Gröbner basis XL algorithm Mutant MutantXL algorithm
Unable to display preview. Download preview PDF.