An Analysis of the XSL Algorithm
An Analysis of the XSL Algorithm
复制标题
DOI：
10.1007/11593447_18
复制
发表时间：
2005-12
影响因子：
5.8
通讯作者：
C. Cid;G. Leurent
中科院分区：
文献类型：
--
作者：
C. Cid;G. Leurent
The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for exploiting the structure of some types of block ciphers, for example the AES and Serpent. Since its proposal, the potential for algebraic attacks against the AES has been the source of much speculation. Although it has attracted a lot of attention from the cryptographic community, currently very little is known about the effectiveness of the XSL algorithm. In this paper we present an analysis of the XSL algorithm, by giving a more concise description of the method and studying it from a more systematic point of view. We present strong evidence that, in its current form, the XSL algorithm does not provide an efficient method for solving the AES system of equations.
