论文部分内容阅读
Trivium是C.De Canniere和B.Preneel在2005年为欧洲eSTREAM项目设计的序列密码,Trivium被选为最终的7个算法之一。Trivium的内部状态为288比特,密钥长度为80比特。文中给出Trivium的分组密码迭代模型,在这个模型下,利用计算程序得出了Trivium各轮输出关于内部状态的线性逼近及其线性逼近概率,当初始化轮数超过246时,其输出关于输入的线性逼近概率不大于1/2+2~(-41)。利用计算机搜索程序,给出Trivium在轮的代数方程规模,利用1 152个输出比特,得到的二次方程组包含6788个变量、11 232个方程,从实验上证明了Trivium算法能抗线性攻击和代数攻击。
Trivium is a serial password designed by C.De Canniere and B.Preneel for the European eSTREAM project in 2005, and Trivium was chosen as one of the final seven algorithms. Trivium has an internal state of 288 bits and a key length of 80 bits. Trivium block cipher iterative model is given in this paper. In this model, the linear approximation of the Trivium outputs and their linear approximation probability are obtained by using the calculation program. When the initialization round number exceeds 246, the output of Trivium is about the input The probability of linear approximation is not greater than 1/2 + 2 ~ (-41). Using the computer search program, Trivium is given the scale of algebraic equations on the wheel. Using 1 152 output bits, the resulting quadratic system contains 6788 variables and 11 232 equations. It is experimentally proved that the Trivium algorithm can resist linear attacks and Algebraic attacks.