期刊文献+

基于Rotation-XOR的MDS线性变换的研究 被引量:1

Research of MDS Linear Transformation Based on Rotation-XOR
下载PDF
导出
摘要 在分组密码的扩散层中构造MDS线性变换可实现良好的扩散性.构造MDS线性变换的方法有很多种,其中基于Rotational-XOR的MDS线性变换软硬件实现效率高,能够增强密码算法抵抗各种密码分析的能力,适用于对称密码算法设计,例如SMS4算法、ZUC算法等.本文研究构造MDS线性变换的必要条件,探寻分组规模为64、分块规模为8时基于Rotational-XOR的MDS线性变换.首先通过分析首行矩阵的性质,给出MDS矩阵的一个必要条件为矩阵中不可能有连续三个矩阵块相同,根据该条件证明此规模下异或项数取最小值9项时不存在MDS线性变换,并利用Magma软件验证该结论.进而研究异或项数为11项时的MDS线性变换,将此情况下的所有线性变换分为三种情况,分别是一个矩阵中至多有一个自由项、存在两个自由项落在同一矩阵中和三个自由项恰好落在同一矩阵中.这三种情况将该规模下的8^8×56×55×54个线性变换等价划分为15种形式,设计15个算法分别搜索后得到此规模下异或项数取11项时也不存在MDS线性变换.本文的结论和搜索方法对研究分块规模为8的MDS扩散层具有启示作用. In the diffusion layer of a block cipher,the construction of MDS linear transformation can achieve good diffusivity,and several kinds of methods can be used to achieve it.The MDS linear transformation based on Rotation-XOR is efficient to implement in hardware and software,it can enhance the resistance of a cryptographic algorithm against various cryptographic analyses,and it has been adopted by many symmetric cryptographic algorithms,such as SMS4 and ZUC.This paper studies the necessary conditions of constructing MDS linear transformations and constructs MDS linear transformations based on Rotation-XOR,where the group size is 64 and the block size is 8.By analyzing the first row of matrix,a necessary condition of MDS matrix is found to be that there does not exist three consecutive identical matrix blocks.Then it is proved that MDS linear transformations do not exist when the number of XOR terms is 9,which can be verified using Magma.Furthermore,the MDS linear transformations when the terms of XOR is 11 are studied.All such linear transformations are divided into three cases,including the cases when there is at most one free term in a matrix,there are two free terms falling in the same matrix and three free terms falling in the same matrix.In these three cases,8~8×56×55×54 linear transformations can be divided into 15 equivalent classes.For all these 15 classes,it was found by computation that MDS linear transformations do not exist when the number of XOR terms is 11.The conclusion and the search method in this paper are instructive to the study of MDS diffusion layer with block size of 8.
作者 张晶 王鑫 张丽娜 杨波 胡冰洁 ZHANG Jing;WANG Xin;ZHANG Li-Na;YANG Bo;HU Bing-Jie(School of Computer Science,Shaanxi Normal University,Xi’an 710119,China)
出处 《密码学报》 CSCD 2020年第5期668-682,共15页 Journal of Cryptologic Research
基金 国家重点研发计划(2017YFB0802000) 国家自然科学基金(61802242,61572303,61772326,61802241) 陕西省自然科学基础研究计划(2018JQ6088) “十三五”国家密码发展基金(MMJJ20180217) 中央高校基本科研业务费项目(GK201803064)。
关键词 分组密码 线性扩散层 循环移位和异或运算 MDS线性变换 block cipher linear diffusion layer rotation-XOR MDS linear transformation
  • 相关文献

参考文献8

二级参考文献45

  • 1崔灵果,曹元大.SPN分组密码中最优扩散层的构造与验证[J].计算机应用,2005,25(4):856-858. 被引量:2
  • 2杜生辉,阮传概.分组密码及其研究[J].通信技术与发展,1995(4):45-49. 被引量:4
  • 3王念平,金晨辉,余昭平.对合型列混合变换的研究[J].电子学报,2005,33(10):1917-1920. 被引量:10
  • 4国家商用密码管理办公室.无线局域网产品使用的SMS4密码算法[EB/OL].http://www.oscca.gov.cn/UpFil/200622026423297990.pdf.
  • 5Schneier B, Kelsey J, and Whiting D, et al.. Twofish: A 128-bit block cipher. Available at http://www.schneier.com/, 2007-2-2.
  • 6Wang Mei-qin. Differential cryptanalysis of present. Cryptology ePrint Archive, Report 2007/408.
  • 7Wu Wen-ling, Zhang Wen-tao, and Feng Deng-guo. Impossible differential cryptanalysis of reduce round ARIA and camellia. Journal of Computer Science and Technology, 2007, 22(3): 449-456.
  • 8Daemen J. Cipher and hash function design strategies based on linear and differential cryptanalysis. [Ph.D. dissertation], KU, Leuven, 1995.
  • 9Kang Ju-sung, Hong Seokhie, and Lee Sangjin, et al.. Practical and provable security against differential and linear cryptanalysis for substitution-permutation networks. ETRI Journal, 2001, 23(4): 158-167.
  • 10Xiao L and Heys H. Hardware design and analysis of block cipher components. Proceedings of the 5th International Conference on Information Security and Cryptology- ICISC'02, 2003 LNCS 2587: 164-181.

共引文献30

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部