42轮SHACAL-2新的相关密钥矩形攻击  

New related-key rectangle attack on 42-round SHACAL-2

作　　者：韦永壮[1,2] 胡予濮[1] 

机构地区：[1]西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西西安710071 [2]桂林电子科技大学信息与通信学院,广西桂林541004

出　　处：《通信学报》2009年第1期7-11,17,共6页Journal on Communications

基　　金：国家自然科学基金资助项目(60673072);国家重点基础研究发展计划(“973”计划)基金资助项目(2007CB311201);国防科技重点实验室基金项目(9140C1107050806)~~

摘　　要：利用SHACAL-2密码算法轮变换的特点,构造了一个新型的34轮区分器。基于该区分器和部分密钥分别猜测的技术,针对40轮、42轮简化SHACAL-2分别给出了新的攻击方法。研究结果表明:利用2个相关密钥,对40轮SHACAL-2进行相关密钥矩形攻击其数据复杂度约为2235选择明文数据量,计算复杂度约为2432.6次加密;而对42轮SHACAL-2进行相关密钥矩形攻击其数据复杂度约为2235选择明文数据量,计算复杂度约为2472.6次加密。与已有的结果相比较,这些新分析所需的数据复杂度和计算复杂度均有明显的降低。A new 34-round related-key rectangle distinguisher was constructed by exploiting the properties of the round transform of SHACAL-2. Moreover, two new relate-key rectangle attacks on 40-round and 42-round reduced SHACAL-2 were presented by using both the distinguisher and a technique of key-byte guessing. It is shown that related-key rectangle attacks with only 2 related keys on 40-round and 42-round reduced SHACAL-2 all require data complexity of about 2235 chosen plaintexts and time complexity of about 2^432.6 encryptions on 40-round reduced SHACAL-2, and 2^472.6 encryptions on 42-round reduced SHACAL-2, respectively. The presented results are better than previous published cryptanalytic results on reduced SHACAL-2 in terms of both the data complexity and the time complexity.

关 键 词：分组密码 相关密钥矩形攻击 SHACAL-2算法 计算复杂度 

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