首页 | 本学科首页   官方微博 | 高级检索  
     

模2n 加和模2加混合运算的异或分支数
引用本文:常亚勤,金晨辉.模2n 加和模2加混合运算的异或分支数[J].软件学报,2011,22(7):1652-1660.
作者姓名:常亚勤  金晨辉
作者单位:解放军信息工程大学电子技术学院,河南郑州,450004
基金项目:河南省杰出青年科学基金
摘    要:研究了扩散结构为二元域上非线性变换的异或分支数.给出了扩散结构为二元域上非线性变换的异或分支数的定义及其与分组密码抗差分攻击和线性分析能力的关系,证明了以模2n加和模2加的混合运算为扩散结构的异或分支数等于将模2n加换成模2加且将各变元系数模2后所得的二元域上线性变换的异或分支数,从而简化了此类非线性扩散结构异或分支数的计算问题.

关 键 词:分组密码  非线性扩散结构  异或分支数  混合运算  可证明安全性
收稿时间:2009/10/18 0:00:00
修稿时间:2010/3/16 0:00:00

On the XOR Branch Numbers of the Transformations About Modulo 2n Addition andModulo 2 Addition
CHANG Ya-Qin and JIN Chen-Hui.On the XOR Branch Numbers of the Transformations About Modulo 2n Addition andModulo 2 Addition[J].Journal of Software,2011,22(7):1652-1660.
Authors:CHANG Ya-Qin and JIN Chen-Hui
Affiliation:(College of Electronic Technology,PLA Information Engineering University,Zhengzhou 450004,China)
Abstract:This paper studies the xor branch numbers of diffusion structures, which uses the nonlinear transformations over the finite field GF(2). This paper gives the definition of the xor branch numbers of diffusion structures and the relations between it and the strength of a cipher against differential and linear cryptanalysis. Also, this paper has proven that the xor branch numbers of diffusion structures is about modulo 2n addition, and the modulo 2 addition is equal to that of the diffusion structure over the finite field GF(2), which 1 is substituted for the odd coefficient and 0 for the even coefficient and the modulo 2n addition for the modulo 2 addition. Consequently, this paper simplifies the computation problem of the xor branch numbers in this kind of nonlinear diffusion structure.
Keywords:block cipher  nonlinear diffusion structure  xor branch number  mixed operator  provable security
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号