@inproceedings {24084,
	title = {On the Number of Linearly Independent Equations Generated by XL},
	journal = {Sequences and Their Applications, SETA 2008},
	volume = {5203},
	year = {2008},
	month = {09/2008},
	pages = {239-251},
	publisher = {Lecture Notes in Computer Science, Springer Verlag},
	abstract = {Solving multivariate polynomial equation systems has been the focus of much attention in cryptography in the last years. Since most ciphers can be represented as a system of such equations, the problem of breaking a cipher naturally reduces to the task of solving them. Several papers have appeared on a strategy known as\&nbsp;eXtended Linearization\&nbsp;(XL) with a view to assessing its complexity. However, its efficiency seems to have been overestimated and its behaviour has yet to be fully understood. Our aim in this paper is to fill in some of these gaps in our knowledge of XL. In particular, by examining how dependencies arise from multiplication by monomials, we give a formula from which the efficiency of XL can be deduced for multivariate polynomial equations over F_2. \&nbsp;This confirms rigorously a result arrived at by Yang and Chen by a completely different approach. The formula was verified empirically by investigating huge amounts of random equation systems with varying degree, number of variables and number of equations.},
	keywords = {Gr{\"o}bner bases, Stream Ciphers, XL},
	isbn = {978-3-540-85911-6},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-85912-3_22},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-85912-3_22},
	author = {R{\o}njom, Sondre and Raddum, H{\r a}vard}
}
