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 $F_4$ algorithm on HFE and randomly generated
multivariate systems. In both cases MutantXL is faster and uses less
memory than the Magma's implementation of $F_4$.
BibTeX - Entry
@InProceedings{buchmann_et_al:DagSemProc.09031.10,
author = {Buchmann, Johannes A. and Ding, Jintai and Mohamed, Mohamed Saied Emam and Mohamed, Wael Said Abd Elmageed},
title = {{MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis}},
booktitle = {Symmetric Cryptography},
pages = {1--7},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9031},
editor = {Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2009/1945},
URN = {urn:nbn:de:0030-drops-19456},
doi = {10.4230/DagSemProc.09031.10},
annote = {Keywords: Multivariate systems, MutantXL}
}
|
Keywords: |
|
Multivariate systems, MutantXL |
|
Collection: |
|
09031 - Symmetric Cryptography |
|
Issue Date: |
|
2009 |
|
Date of publication: |
|
30.03.2009 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)