MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis

Johannes Buchmann TU Darmstadt, FB Informatik Hochschulstrasse 10, 64289 Darmstadt, Germany Jintai Ding Department of Mathematical Sciences, University of Cincinnati Cincinnati OH 45220, USA Mohamed Saied Emam Mohamed TU Darmstadt, FB Informatik Hochschulstrasse 10, 64289 Darmstadt, Germany Wael Said Abd Elmageed Mohamed TU Darmstadt, FB Informatik Hochschulstrasse 10, 64289 Darmstadt, Germany

TBD mathscidoc:2207.43106

Symmetric Cryptography 2009, 2009.3
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$.
No keywords uploaded!
[ Download ] [ 2022-07-21 14:52:09 uploaded by dingjt ] [ 35 downloads ] [ 0 comments ]
@inproceedings{johannes2009mutantxl:,
  title={MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis},
  author={Johannes Buchmann, Jintai Ding, Mohamed Saied Emam Mohamed, and Wael Said Abd Elmageed Mohamed},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220721145209206787688},
  booktitle={Symmetric Cryptography 2009},
  year={2009},
}
Johannes Buchmann, Jintai Ding, Mohamed Saied Emam Mohamed, and Wael Said Abd Elmageed Mohamed. MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis. 2009. In Symmetric Cryptography 2009. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220721145209206787688.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved