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

基于矩阵的代替置换网络抗差分密码分析
引用本文:朱峰,郭宝安,戴一奇.基于矩阵的代替置换网络抗差分密码分析[J].清华大学学报(自然科学版),2000,40(9):41-44.
作者姓名:朱峰  郭宝安  戴一奇
作者单位:清华大学,计算机科学与技术系,北京,100084
基金项目:国家“九七三”基础研究基金项目!(G19980 30 42 1),国家自然科学基金项目!(6 9872 0 19)
摘    要:在分组密码的设计中 ,提高分组密码的抗差分攻击性能是一个重要的课题。论文提出了一种基于矩阵的代替置换网络模型。基于这一模型 ,设计了一个称为基于全非奇异矩阵的代替置换网络的密码结构。给出了基于全非奇异矩阵的代替置换网络的差分概率上界。证明了当使用大规模的基于全奇异矩阵的代替置换网络时 ,i圈基于全奇异矩阵的代替置换网络的差分概率上界迅速减小。指出了使用大规模的基于全奇异矩阵的代替置换网络可有效地提高分组密码抗差分密码分析的安全性。

关 键 词:分组密码  差分密码分析  代替-置换网络
修稿时间:1999-07-16

Matrix-based substitution-permutation network against differential cryptanalysis
ZHUFeng,GUOBaoan,DAIYiqi.Matrix-based substitution-permutation network against differential cryptanalysis[J].Journal of Tsinghua University(Science and Technology),2000,40(9):41-44.
Authors:ZHUFeng  GUOBaoan  DAIYiqi
Abstract:An important problem in the design of the block cipher is to improve the performance of the resisting differential cryptanalysis. This paper proposes a matrix based substitution permutation network as the model of block cipher. Based on this model, a new crypt structure called completely nonsingular matrix based substitution permutation network is designed. The upper bound of the differential probability is developed for the completely nonsingular matrix based substitution permutation network. The analysis proves that the upper bound of the differential probability of the i rounds completely nonsingular matrix based substitution permutation network 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 differential cryptanalysis.
Keywords:block  cipher  differential cryptanalysis  substitution  permutation network
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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