MutantXL

MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis. MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008 and improved in PQC 2008. This article gives an overview over the MutantXL algorithm. It also presents experimental results comparing the behavior of the MutantXL algorithm to the F4 algorithm on HFE and randomly generated multi- variate systems. In both cases MutantXL is faster and uses less memory than the Magma’s implementation of F4.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 5 articles )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Caminata, Alessio; Gorla, Elisa: Solving multivariate polynomial systems and an invariant from commutative algebra (2021)
  2. Chakraborty, Olive; Faugère, Jean-Charles; Perret, Ludovic: Cryptanalysis of the extension field cancellation cryptosystem (2021)
  3. Huang, Ming-Deh A.; Kosters, Michiel; Yang, Yun; Yeo, Sze Ling: On the last fall degree of zero-dimensional Weil descent systems (2018)
  4. Ullah, E.; Abbas Khan, S.: Computing border bases using mutant strategies (2014)
  5. Albrecht, Martin R.; Cid, Carlos; Faugère, Jean-Charles; Perret, Ludovic: On the relation between the MXL family of algorithms and Gröbner basis algorithms (2012)