计算机工程Issue(11)：31-34,40,5.DOI:10.3969/j.issn.1000-3428.2013.11.007
2轮Trivium的线性逼近研究
Study on Linear Approximation of 2-round Trivium
摘要
Abstract
Trivium is an important international sequence cryptography. Jia Yan-yan(Journal of Electronics&Information Technology, 2011, (6)) attacks 2-round Trivium by utilizing a simple and multiple linear cryptanalysis. In the light of few linear approximation and little deviation in their papers. This paper presents a method to conduct linear cryptanalysis of 2-round Trivium by changing clock number and linear approximations of the first round, and proposes a linear approximation with deviation 2-29 and 8 linear approximations with deviation 2-30. Moreover, utilizing the algorithm of Jia Yan-yan paper attacks 2-round Trivium by simple and multiple linear cryptanalysis. Study result shows that, in order to identify a secret key given, the method can supply the success rate with 1/16 of data amount compared with the foregone data amount required, namely, the number of chosen Initial Vector(IV) are 258 and 257, respectively.关键词
序列密码/Trivium算法/密码分析/线性近似/线性攻击/偏差Key words
sequence cryptography/Trivium algorithm/cryptanalysis/linear approximation/linear attack/deviation分类
信息技术与安全科学引用本文复制引用
欧智慧,赵亚群..2轮Trivium的线性逼近研究[J].计算机工程,2013,(11):31-34,40,5.基金项目
国家自然科学基金资助项目(61072046) （61072046）
