分组密码二元扩散结构的几点注记  

Several Properties of Binary Diffusion Layers for Block Cipher

作　　者：崔霆[1] 陈河山[2] 金晨辉[1] 

机构地区：[1]信息工程大学电子技术学院,河南郑州450004 [2]河南大学,河南开封475001

出　　处：《软件学报》2012年第9期2430-2437,共8页Journal of Software

基　　金：国家自然科学基金(61272488;60272041)

摘　　要：0-1矩阵常用于设计分组密码的扩散结构.首先证明,当GF(2n)上的矩阵重新定义在扩域GF(2mn)上时其分支数保持不变,据此补充了Choy等人关于GF(2n)上二元矩阵分支数上界的证明.构造了一批分支数达到最优的8阶二元可逆矩阵,给出了一类差分分支数和线性分支数相等的二元可逆矩阵,并从中搜索出了大量16阶分支数达到最优的二元矩阵和对合二元矩阵.0-1 matrices are often-used in the design of diffusion structures in block ciphers. This paper first proves that the branch number of matrix over GF（2n） does not change while it is redefined over the extension field GF（2mn）. By this result, the study reinforces the proof given by Choy et al., which is about the upper bound of branch number of binary matrices over GF（2n）. This paper constructs a kind of invertible binary matrices with size 8 and largest branch number, proposes a kind of matrices with equal differential branch number and linear branch number, and also includes lots of matrices and involution matrices with order 16 and optimal branch number with this structure are searched out.

关 键 词：分组密码 扩散结构 分支数 0-1矩阵 

分 类 号：TN309[电子电信—物理电子学]