对ARIA算法中间相遇攻击的改进

doi:10.11959/j.issn.1000-436x.2015062

通信学报 ›› 2015, Vol. 36 ›› Issue (3): 89-94.doi: 10.11959/j.issn.1000-436x.2015062

对ARIA算法中间相遇攻击的改进

李曼曼^1,²,陈少真^1,²

¹ 解放军信息工程大学网络空间安全学院，河南郑州 450001
² 数学工程与先进计算国家重点实验室，河南郑州 450001

出版日期:2015-03-25 发布日期:2017-06-21
基金资助:
信息保障技术重点实验室开放基金资助项目

Improved meet-in-the-middle attack on ARIA cipher

Man-man LI^1,²,Shao-zhen CHEN^1,²

¹ Institute of Cyberspace Security, The PLA Information Engineering University,Zhengzhou 450001,China
² State Key Laboratory of Mathematical Engineering and Advanced Computing,Zhengzhou 450001,China

Online:2015-03-25 Published:2017-06-21

摘要/Abstract

摘要：

对ARIA算法的结构特征进行了研究，利用“多重集”并结合截断差分的性质，将预计算的参数由30个减少到16个，构造新的4轮中间相遇区分器，有效地改进了ARIA-192算法的7轮中间相遇攻击。新攻击的预计算复杂度为2^135.3，时间复杂度约为2¹²³。

关键词: 分组密码, ARIA算法, 中间相遇攻击, 时间复杂度

Abstract:

A study on the structure of ARIA cipher is presented. A new 4-round distinguishing property for the meet-in-the-middle attack on ARIA cipher is presented by making use of the multiset and the truncated differential char-acteristic. The new distinguishing property improves the meet-in-the-middle attack on 7 rounds of ARIA-192 cipher ef-fectively by reducing the 30 parameters to 16. The new attack requires a precomputation complexity of 2^135.3and a time complexity of about 2¹²³.

Key words: block cipher, ARIA cipher, meet-in-the-middle attack, time complexity

李曼曼,陈少真. 对ARIA算法中间相遇攻击的改进[J]. 通信学报, 2015, 36(3): 89-94.

Man-man LI,Shao-zhen CHEN. Improved meet-in-the-middle attack on ARIA cipher[J]. Journal on Communications, 2015, 36(3): 89-94.

图/表 4

参考文献 15

[1]	KWON D , KIM J . Specification of ARIA[EB/OL]. . 2003.08.
[2]	BIRYUKOV A , CANNIERE C , et al. Security and performance analysis of ARIA[EB/OL]. . 2004.07.
[3]	WU W , ZHANG W , FENG D . Impossible differential cryptanalysis of reduced-round ARIA and Camellia[J]. Journal of Computer Science and Technology, 2007,22(3):449-456.
[4]	LI S , SONG C . Improved impossible differential cryptanalysis of ARIA[A]. ISA 2008, IEEE Computer Society[C]. Los Alamitos, 2008.129-132.
[5]	FLEISCHMANN E , GORSKI M , LUCKS S . Attacking reduced rounds of the ARIA block cipher[EB/OL]. . 2009.07.
[6]	LI Y , WU W , ZHANG L . Integral attacks on reduced-round ARIA block cipher[A]. ISPEC 2010[C]. 2010.19-29.
[7]	DU C , CHEN J . Impossible differential cryptanalysis of ARIA reduced to 7 rounds[A]. CANS 2010[C]. 2010.20-30.
[8]	TANG X , SUN B , LI R . A meet-in-the-middle attack on re-duced-round ARIA[J]. Journal of Systems and Software, 2011,84(10):1685-1692.
[9]	苏崇茂． 7轮ARIA-256的不可能差分新攻击[J]．计算机应用， 2012,32(1):45-48. SU C M . New impossiblediferential attack on 7-round reduced ARIA[J]. Journal of Computer Applications, 2012,32(1):45-48.
[10]	ZHANG W , LIU F , LIU X , MENG S . Differential fault analysis and meet-in-the-middle attack on the block cipher KATAN32[J]. Journal of Shanghai Jiaotong University (Science), 2013,18(2):147-152.
[11]	LU J , WEI Y . The higher-order meet-in-the-middle attack and its application to the camellia block cipher[A]. INDOCRYPT 2012[C]. 2012.244-264.
[12]	LU J , WEI Y . Meet-in-the-middle attack on reduced versions of the camellia block cipher[A]. IWSEC 2012[C]. 2012.197-215.
[13]	DUNKELMAN O , KELLER N , SHAMIR A . Improved single-key attacks on 8-round AES[A]. ASIACRYPT 2010[C]. 2010.158-176.
[14]	JOHANSSON T , NGUYEN P . Improved key recovery attacks on reduced-round AES in the single-key setting[A]. EUROCRYPT 2013[C]. 2013.371-387.
[15]	DU C , CHEN J . Improved meet-in-the-middle attacks on ARIA[A]. ISAI 2010[C]. 2010.306-310.

文献	对象	攻击方法	轮数	预计算	数据	时间
文献[3]	ARIA-128	不可能差分攻击	6	—	2¹²¹	2¹¹²
文献[4]	ARIA-128	不可能差分攻击	6	—	2¹²⁰	2⁹⁶
文献[9]	ARIA-192	中间相遇攻击	7	2¹⁸⁷	2¹²⁰	2^185.3
文献[15]	ARIA-192	中间相遇攻击	7	2^174.2	2¹²⁰	2^184.7
本文	ARIA-192	中间相遇攻击	7	2^135.3	2¹¹³	2¹²³
文献[2]	ARIA-256	积分攻击	7	—	2^100.6	2^225.8
文献[7]	ARIA-256	不可能差分攻击	7	—	2¹²⁵	2²³⁸
文献[9]	ARIA-256	不可能差分攻击	7	—	2¹²⁰	2²¹⁹

对ARIA算法中间相遇攻击的改进

Improved meet-in-the-middle attack on ARIA cipher

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 4

参考文献 15

相关文章 15

Metrics

推荐阅读 0

[1]	胡斌, 谈潇, 王森鹏. 基于分治策略的SAT差分自动化搜索算法及其应用[J]. 通信学报, 2023, 44(4): 137-144.
[2]	杜少宇. 积分攻击改进——随机线性区分与密钥恢复攻击[J]. 通信学报, 2023, 44(4): 145-153.
[3]	刘正斌, 李永强, 朱朝熹. 分组密码最小活跃S盒个数快速搜索算法[J]. 通信学报, 2023, 44(1): 118-128.
[4]	李曼曼, 陈少真. 改进的减轮Kiasu-BC算法的中间相遇攻击[J]. 通信学报, 2022, 43(7): 41-48.
[5]	蒋梓龙, 金晨辉. Saturnin算法的不可能差分分析[J]. 通信学报, 2022, 43(3): 53-62.
[6]	谢敏,李嘉琪,田峰. FeW的差分故障攻击[J]. 通信学报, 2020, 41(4): 143-149.
[7]	武小年,李迎新,韦永壮,孙亚平. GRANULE和MANTRA算法的不可能差分区分器分析[J]. 通信学报, 2020, 41(1): 94-101.
[8]	谢敏,田峰,李嘉琪. TWINE算法的相关密钥不可能飞来去器攻击[J]. 通信学报, 2019, 40(9): 184-192.
[9]	沈煜,李玮,谷大武,吴益鑫,曹珊,刘亚,刘志强,周志洪. ARIA密码的积分故障分析[J]. 通信学报, 2019, 40(2): 164-173.
[10]	邹剑,董乐. 对缩减轮数SM3散列函数改进的原像与伪碰撞攻击[J]. 通信学报, 2018, 39(1): 46-55.
[11]	高杨,王永娟,王磊,王涛. 轻量级分组密码算法TWINE差分故障攻击的改进[J]. 通信学报, 2017, 38(Z2): 178-184.
[12]	谢敏,牟彦利. LBlock算法的相关密钥不可能飞来去器分析[J]. 通信学报, 2017, 38(5): 66-71.
[13]	崔杰,左海风,仲红. 对轻量级分组密码I-PRESENT-80和I-PRESENT-128的biclique攻击[J]. 通信学报, 2017, 38(11): 13-23.
[14]	王敏,吴震,饶金涛,凌杭. 针对SM4算法的约减轮故障攻击[J]. 通信学报, 2016, 37(Z1): 98-103.
[15]	王永娟,任泉宇,张诗怡. 轻量级分组密码Klein的差分故障攻击[J]. 通信学报, 2016, 37(Z1): 111-115.