MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- 1.4k Downloads
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 F 4. 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 F 4 implementation.
Unable to display preview. Download preview PDF.
- 7.Ding, J., Buchmann, J., Mohamed, M.S.E., Moahmed, W.S.A., Weinmann, R.P.: MutantXL. In: Proceedings of the 1st international conference on Symbolic Computation and Cryptography (SCC 2008), Beijing, China, LMIB, pp. 16–22 (2008), http://www.cdc.informatik.tu-darmstadt.de/reports/reports/MutantXL_Algorithm.pdf
- 8.Ding, J., Cabarcas, D., Schmidt, D., Buchmann, J., Tohaneanu, S.: Mutant Gröbner Basis Algorithm. In: Proceedings of the 1st international conference on Symbolic Computation and Cryptography (SCC 2008), Beijing, China, LMIB, pp. 23–32 (2008)Google Scholar
- 9.Courtois, N.T.: Experimental Algebraic Cryptanalysis of Block Ciphers (2007), http://www.cryptosystem.net/aes/toyciphers.html
- 10.Segers, A.: Algebraic Attacks from a Gröbner Basis Perspective. Master’s thesis, Department of Mathematics and Computing Science, TECHNISCHE UNIVERSITEIT EINDHOVEN, Eindhoven (2004)Google Scholar
- 11.Shigeo, M.: Hotaru (2005), http://cvs.sourceforge.jp/cgi-bin/viewcvs.cgi/hotaru/hotaru/hfe25-96?view=markup
- 12.Albrecht, M., Bard, G.: M4RI – Linear Algebra over GF(2) (2008), http://m4ri.sagemath.org/index.html