改进的Keccak算法4轮区分器  

Improved 4-Round Distinguisher for the Keccak Algorithm

作　　者：刘景美[1] 薛宁[1] 赵林森[2] 

机构地区：[1]西安电子科技大学综合业务网国家重点实验室,西安710071 [2]西安邮电大学电子工程学院,西安710061

出　　处：《电子科技大学学报》2016年第3期453-457,共5页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(60903199);高等学校创新引智基地基金(B08038);国家留学基金委项目(201506965088)

摘　　要：Keccak算法是新一代Hash函数标准SHA-3的获胜算法。如何构造一个好的区分器是当前Hash函数中的研究热点。该文在分析Keccak算法及算法中各个置换性质的基础上,通过线性分析方法和差分分析方法,研究了整体Keccak算法的差分传播特性。利用Keccak旋转变换和z周期性质,成功构造出4轮Keccak置换的区分器。通过分析Keccak算法的旋转对的传播特性,对Morawiecki区分器的构造方法进行了修正改进。实验结果表明该区分随机置换和Keccak变换的区分概率更大,区分效果比Morawiecki构造的区分器区分效果更好。The Keccak algorithm is selected as the new Hash function standard of SHA-3 fianally. How to construct a good distinguisher is a hot topic in cryptanalysis of the Hash function at present. In this paper, on the base of the permutation property, we research the differential propagation characteristics of the Keccak algorithm by the linear and differential cryptanalysis methods. By using the Keccak rotation transform characteristics and z cycle properties, we construct the distinguisher of the 4-round Keccak permutation successfully. Then we improve the 4-round Morawiecki＇ distinguisher of the Keccak algorithm by using the propagation characteristics of the rotational pair. The research results show that our improved rotational distinguisher can distinguish the random permutation from the Keccak permutation with a higher probability, and the distinguish effect is better than Morawiecki＇s distinguisher.

关 键 词：差分分析 HASH函数 Keccak算法 随机置换 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]