Abstract
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 multivariate systems. In both cases MutantXL is faster and uses less memory than the Magma's implementation of F4.
| Original language | English |
|---|---|
| Journal | Dagstuhl Seminar Proceedings |
| Volume | 9031 |
| Publication status | Published - 2009 |
| Externally published | Yes |
| Event | Symmetric Cryptography 2009 - Wadern, Germany Duration: 11 Jan 2009 → 16 Jan 2009 |
Fingerprint
Dive into the research topics of 'MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver