11轮3D分组密码算法的中间相遇攻击

doi:10.11772/j.issn.1001-9081.2015.03.700

计算机应用 ›› 2015, Vol. 35 ›› Issue (3): 700-703.DOI: 10.11772/j.issn.1001-9081.2015.03.700

11轮3D分组密码算法的中间相遇攻击

李灵琛^1,2, 韦永壮^1,3, 朱嘉良^1,3

1. 广西信息科学实验中心(桂林电子科技大学), 广西桂林 541004;
2. 综合业务网理论及关键技术国家重点实验室(西安电子科技大学), 西安 710071;
3. 信息安全国家重点实验室(中国科学院信息工程研究所), 北京 100190

收稿日期:2014-10-22 修回日期:2014-11-20 出版日期:2015-03-10 发布日期:2015-03-13
通讯作者: 李灵琛
作者简介:李灵琛(1988-),女(回族),广西桂林人,硕士研究生,主要研究方向:信息安全;韦永壮(1976-),男(壮族),广西桂林人,教授,博士,主要研究方向:信息安全;朱嘉良(1987-),男,黑龙江绥化人,硕士研究生,主要研究方向:信息安全
基金资助:
国家自然科学基金资助项目(61100185)

Meet-in-the-middle attack on 11-round reduced 3D block cipher

LI Lingchen^1,2, WEI Yongzhuang^1,3, ZHU Jialiang^1,3

1. Guangxi Experiment Center of Information Sciences (Guilin University of Electronic Technology), Guilin Guangxi 541004, China;
2. State Key Laboratory of Integrated Services Networks (Xidian University), Xi'an Shaanxi 710071, China;
3. State Key Laboratory of Information Security (Institute of Information Engineering, Chinese Academy of Sciences), Beijing 100190, China

Received:2014-10-22 Revised:2014-11-20 Online:2015-03-10 Published:2015-03-13

摘要/Abstract

摘要：

针对3D分组密码算法的安全性分析,对该算法抵抗中间相遇攻击的能力进行了评估。基于3D算法的基本结构及S盒的差分性质,减少了在构造多重集时所需的猜测字节数,从而构建了新的6轮3D算法中间相遇区分器。然后,将区分器向前扩展2轮,向后扩展3轮,得到11轮3D算法中间相遇攻击。实验结果表明:构建区分器时所需猜测的字节数为42 B,攻击时所需的数据复杂度约为2⁴⁹⁷个选择明文,时间复杂度约为2^325.3次11轮3D算法加密,存储复杂度约为2³⁴² B。新攻击表明11轮3D算法对中间相遇攻击是不免疫的。

关键词: 分组密码, 3D算法, 中间相遇攻击, S盒, 区分器

Abstract:

Focusing on the safety analysis of the 3D block cipher, a new method on this algorithm against the meet-in-the-middle attack was proposed. Based on the structure of the 3D algorithm and the differential properties of the S-box, the research reduced the number of required bytes during structuring the multiple sets in this attack and constructed a new 6-round meet-in-the-middle distinguisher. According to extending the distinguisher 2-round forward and 3-round backward, an 11-round meet-in-the-middle attack of the 3D algorithm was finally achieved. The experimental results show that:the number of required bytes on constructed the distinguisher is 42, the attack requires a data complexity of about 2⁴⁹⁷ chosen plaintexts, a time complexity of about 2^325.3 11-round 3D algorithm encryption and a memory complexity of about 2³⁴² bytes. The new attack shows that the 11-round of the 3D algorithm is not immune to the meet-in-the-middle attack.

Key words: block cipher, 3D algorithm, meet-in-the-middle attack, S-box, distinguisher

中图分类号:

TP309.7

李灵琛, 韦永壮, 朱嘉良. 11轮3D分组密码算法的中间相遇攻击[J]. 计算机应用, 2015, 35(3): 700-703.

LI Lingchen, WEI Yongzhuang, ZHU Jialiang. Meet-in-the-middle attack on 11-round reduced 3D block cipher[J]. Journal of Computer Applications, 2015, 35(3): 700-703.

参考文献

[1] NAKAHARA J J. 3D: a three-dimensional block cipher[M]//FRANKLIN M K, HUI L C K, WONG D S. Cryptology and Network Security,LNCS 5339. Berlin: Springer, 2008:252-267.
[2] DAEMEN J, RIJMEN V. Rijndael/AES[M]//van TILBORG H C A. Encyclopedia of Cryptography and Security. Berlin: Springer, 2005:520-524.
[3] TANG X, LI C, WANG M, et al. Impossible differential attack on 3D cipher[J]. Journal of Electronics and Information Technology, 2010,32(10):2516-2520.(唐学海,李超,王美一,等.3D密码的不可能差分攻击[J].电子与信息学报,2010,32(10):2516-2520.)
[4] WANG M, TANG X, LI C, et al. Square attacks on 3D cipher[J]. Journal of Electronics and Information Technology, 2010,32(1):157-161.(王美一,唐学海,李超,等.3D密码的Square攻击[J].电子与信息学报,2010,32(1):157-161.)
[5] DONG L, WU W, WU S, et al. Known-key distinguisher on round-reduced 3D block cipher[M]//JUNG S, YUNG M. Information Security Applications, LNCS 7115. Berlin: Springer, 2012:55-69.
[6] SU C, WEI Y, MA C. Meet-in-the-middle attack on 10-round reduced 3D block cipher[J]. Journal of Electronics and Information Technology, 2012,34(3):694-697.(苏崇茂,韦永壮,马春波.10轮3D分组密码算法的中间相遇攻击[J].电子与信息学报,2012,34(3):694-697.)
[7] KOYAMA T, WANG L, SASAKI Y, et al. New truncated differential cryptanalysis on 3D block cipher[M]//RYAN M D, SMYTH B, WANG G. Information Security Practice and Experience, LNCS 7232. Berlin: Springer, 2012:109-125.
[8] LI M, CHEN S. Improved meet-in-the-middle attack on 10 round 3D cipher[J]. Journal of Information Engineering University, 2013,14(3):257-262.(李曼曼,陈少真.改进的10轮3D密码算法的中间相遇攻击[J].信息工程大学学报,2013,14(3):257-262.)
[9] BARRETO P, RIJMEN V. The anubis block cipher[EB/OL].[2014-05-10]. http://www.larc.usp.br/~pbarreto/AnubisPage.html.
[10] DIFFIE W, HELLMAN M E. Special feature exhaustive cryptanalysis of the NBS data encryption standard[J]. Computer, 1977,10(6):74-84.
[11] DUNKELMAN O, KELLER N, SHAMIR A. Improved single-key attacks on 8-round AES-192 and AES-256[M]//ABE M. Advances in Cryptology-ASIACRYPT 2010, LNCS 6477. Berlin: Springer, 2010:158-176.
[12] LU J, DUNKELMAN O, KELLER N, et al. New impossible differential attacks on AES[M]//CHOWDHURY D R, RIJMEN V, DAS A. Progress in Cryptology-INDOCRYPT 2008, LNCS 5365. Berlin: Springer, 2008:279-293.
[13] DERBEZ P, FOUQUE P A, JEAN J. Improved key recovery attacks on reduced-round AES in the single-key setting[C]//Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2013:371-378.

[1]	丛旌, 韦永壮, 刘争红. SM4密码算法的阶梯式相关能量分析[J]. 计算机应用, 2020, 40(7): 1977-1982.
[2]	刘宗甫, 袁征, 赵晨曦, 朱亮. 对PICO算法基于可分性的积分攻击[J]. 计算机应用, 2020, 40(10): 2967-2972.
[3]	刘晓强, 韦永壮, 刘争红. 新的低轮Keccak线性结构设计[J]. 计算机应用, 2018, 38(10): 2934-2939.
[4]	赵颖, 叶涛, 韦永壮. 几类高强度密码S盒的安全性新分析[J]. 计算机应用, 2017, 37(9): 2572-2575.
[5]	马云飞, 王韬, 陈浩, 黄长阳. 轻量级分组密码SIMON代数故障攻击[J]. 计算机应用, 2017, 37(7): 1953-1959.
[6]	程璐, 魏悦川, 潘晓中, 李安辉. Zodiac密码算法的多维零相关线性分析[J]. 计算机应用, 2017, 37(6): 1605-1608.
[7]	王寿成, 徐进辉, 严迎建, 李功丽, 贾永旺. 面向密码流处理器的AES算法软件流水实现方法[J]. 计算机应用, 2017, 37(6): 1620-1624.
[8]	胡志华, 颜硕, 熊宽江. 不可能差分性质更优的动态S盒构造方法[J]. 计算机应用, 2016, 36(5): 1257-1261.
[9]	覃冠杰, 马建设, 程雪岷. 基于组合式爬山算法提高S盒非线性度的方法[J]. 计算机应用, 2015, 35(8): 2195-2198.
[10]	卫宏儒郑雅菲王新宁. ARIRANG-256的Biclique攻击[J]. 计算机应用, 2014, 34(1): 69-72.
[11]	刘青卫宏儒潘伟. Zodiac算法的碰撞攻击[J]. 计算机应用, 2014, 34(1): 73-77.
[12]	何远田四梅. 基于混沌S盒的无线传感器网络分组加密算法[J]. 计算机应用, 2013, 33(04): 1081-1084.
[13]	苏崇茂. 7轮ARIA-256的不可能差分新攻击[J]. 计算机应用, 2012, 32(01): 45-48.
[14]	卢丹华钟诚杨锋. 基于多核多线程的AES保密模式[J]. 计算机应用, 2011, 31(04): 1003-1005.
[15]	杨宏志韩文报赵龙. 适于硬件实现的S盒构造方法[J]. 计算机应用, 2010, 30(3): 674-676.

11轮3D分组密码算法的中间相遇攻击

Meet-in-the-middle attack on 11-round reduced 3D block cipher

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics