Chosen-plaintext linear attacks on Serpent
Chosen-plaintext linear attacks on Serpent
复制标题
DOI：
10.1049/iet-ifs.2012.0287
复制
发表时间：
2013-12
期刊：
影响因子：
--
通讯作者：
Jialin Huang;Xuejia Lai
中科院分区：
文献类型：
--
作者：
Jialin Huang;Xuejia Lai
在这项研究中，作者考虑了对简化圆形Serpent的线性攻击的选择明文变体。通过合理地固定10轮Serpent的明文的部分，在具有单一近似的线性攻击中所需的文本数量可以显著减少222倍。作者还给出了迄今为止10轮Serpent的最佳数据复杂度，为280。此外，作者将选择明文技术推广到使用多重近似的线性攻击，并在不同的情况下改善了密码分析的数据复杂度和时间复杂度。作为应用，该技术的有效性，在多维线性模型的5轮蛇的实验。
In this study, the authors consider chosen-plaintext variants of the linear attack on reduced round Serpent. By reasonably fixing parts of the plaintexts of 10-round Serpent the number of texts required in a linear attack with single approximation can be significantly reduced by a factor of 222. The authors also give the best data complexity on 10-round Serpent so far, which is 280. Moreover, the authors extend the chosen-plaintext technique to the linear attack using multiple approximations and improve the results of cryptanalysis in data complexity or/and time complexity in different scenarios. As an application to show the usefulness of this technique, an experiment in the multidimensional linear model on 5-round Serpent is given.