dimensions_id
pub.1000585614
203-215
true
2019-04-16T06:11
2008
https://link.springer.com/10.1007%2F978-3-540-88403-3_14
2008-01-01
chapters
https://scigraph.springernature.com/explorer/license/
en
MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008. This paper proposes two substantial improvements to this algorithm over GF(2) that result in significantly reduced memory usage. We present experimental results comparing MXL2 to the XL algorithm, the MutantXL algorithm and Magma’s implementation of F4. For this comparison we have chosen small, randomly generated instances of the MQ problem and quadratic systems derived from HFE instances. In both cases, the largest matrices produced by MXL2 are substantially smaller than the ones produced by MutantXL and XL. Moreover, for a significant number of cases we even see a reduction of the size of the largest matrix when we compare MXL2 against Magma’s F4 implementation.
chapter
MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
10.1007/978-3-540-88403-3_14
doi
Springer Nature - SN SciGraph project
Ding
Jintai
Berlin, Heidelberg
Springer Berlin Heidelberg
Pure Mathematics
University of Cincinnati
Department of Mathematical Sciences, University of Cincinnati, OH 45220, Cincinnati, USA
TU Darmstadt, FB Informatik, Hochschulstrasse 10, 64289, Darmstadt, Germany
Technical University of Darmstadt
Mohamed
Wael Said Abd Elmageed
Mohamed
Mohamed Saied Emam
Johannes
Buchmann
Mathematical Sciences
Buchmann
Johannes
Ding
Jintai
readcube_id
02c9e6fde289aa84375e24f5211970256bd76bd846c543bb1ec558f583a3101b
Post-Quantum Cryptography
978-3-540-88402-6
978-3-540-88403-3