G. V. Bard, N. T. Courtois, and C. Jefferson, Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers. Cryptology ePrint Archive, Report, p.24, 2007.

A. Becker, A. Joux, A. May, and A. Meurer, Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Advances in Cryptology?EUROCRYPT 2012, pp.520-536, 2012.
DOI : 10.1007/978-3-642-29011-4_31

N. Courtois, D. Hulme, and T. Mourouzis, Solving circuit optimisation problems in cryptography and cryptanalysis, Cryptology ePrint Archive Report, p.475, 2011.

J. C. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) In: Workshop on Applications of Commutative Algebra, pp.3-6, 2002.

H. Raddum, MRHS Equation Systems, pp.232-245, 2007.
DOI : 10.1007/978-3-540-77360-3_15

H. Raddum and I. Semaev, Solving Multiple Right Hand Sides linear equations, Designs, Codes and Cryptography, vol.139, issue.1-3, pp.147-160, 2008.
DOI : 10.1007/s10623-008-9180-z

N. Sendrier, Decoding One Out of Many, pp.51-67, 2011.
DOI : 10.1007/3-540-45708-9_19

P. Zajac, A new method to solve MRHS equation systems and its connection to group factorization, Journal of Mathematical Cryptology, vol.7, issue.4, pp.367-381, 2013.
DOI : 10.1515/jmc-2013-5012

P. Zajac and R. Cagala, Local reduction and the algebraic cryptanalysis of the block cipher gost, Periodica Mathematica Hungarica, vol.114, issue.2, pp.239-255, 2012.
DOI : 10.1007/s10998-012-6376-9

P. Zajac and M. Jókay, Multiplicative complexity of bijective 4??4 S-boxes, Cryptography and Communications, vol.7, issue.4, pp.255-277, 2014.
DOI : 10.1007/s12095-014-0100-y