基于矩阵的代替置换网络抗线性密码分析  

Matrix-based substitution- permutation network against linear cryptanalysis

作　　者：朱峰[1] 郭宝安[1] 戴一奇[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《清华大学学报（自然科学版）》2000年第9期45-48,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金项目 !(6 9872 0 19);国家"九七三"基础研究基金项目 !(G19980 30 42 1)

摘　　要：包含代替置换网络的分组密码是一种广泛使用的分组密码系统。论文介绍了一种基于全非奇异矩阵的代替置换网络 ,它可有效的提高分组密码抗线性密码分析的能力。论文给出了基于全非奇异矩阵的代替置换网络的线性壳概率上界。证明了当使用大规模的基于全奇异矩阵的代替置换网络时 ,i圈基于全奇异矩阵的代替置换网络的线性壳概率上界迅速减小。The block cipher with a substitution permutation network is the best known and widely used block cipher system. This paper introduces a completely nonsingular matrix based substitution permutation network that can effectively improve the performance of the block cipher against linear cryptanalysis. The upper bound of the linear hull probability for the i rounds completely nonsingular matrix based substitution permutation networks is greatly reduced when a large completely nonsingular matrix based substitution permutation network is used. Therefore using large completely nonsingular matrix based substitution permutation networks can effectively improve cipher security in relation to linear cryptanalysis.

关 键 词：分组密码 线性密码分析 矩阵 代替-置换网络 

分 类 号：TN918.4[电子电信—通信与信息系统]