针对51步RIPEMD-160区分攻击的复杂度分析

doi:10.19678/j.issn.1000-3428.0052363

计算机工程 ›› 2019, Vol. 45 ›› Issue (9): 147-152. doi: 10.19678/j.issn.1000-3428.0052363

针对51步RIPEMD-160区分攻击的复杂度分析

崔斌斌, 王高丽

华东师范大学计算机科学与软件工程学院, 上海 200062

收稿日期:2018-08-10 修回日期:2018-10-05 出版日期:2019-09-15 发布日期:2019-09-03
作者简介:崔斌斌(1993-),男,硕士研究生,主研方向为信息安全、哈希函数;王高丽(通信作者),副教授
基金资助:
国家密码发展基金（MMJJ20180201）。

Complexity Analysis of Distinguishing Attack on 51-step RIPEMD-160

CUI Binbin, WANG Gaoli

School of Computer Science and Software Engineering, East China Normal University, Shanghai 200062, China

Received:2018-08-10 Revised:2018-10-05 Online:2019-09-15 Published:2019-09-03

摘要/Abstract

摘要： SASAKI Y等人使用消息修改技术对51步RIPEMD-160算法进行区分攻击时（Lecture Notes in Computer Science，Vol.7341），未考虑模减差分对差分路线的影响，不能保证左右操作前半部分成立的概率为1，导致所得到的复杂度有误。为此，通过2-dimension sums方法构建RIPEMD-160区分器，在此基础上提出一种改进的区分攻击复杂度分析方法。给出保证差分路线中模减差分成立的充分条件，使消息修改后左右操作差分路线前半部分成立的概率由2^-7.717增加到1，从而提高区分器成立概率，同时通过实验测试得到后半部分差分路线成立的概率。分析结果表明，51步RIPEMD-160算法区分攻击的复杂度为2^152.672。

关键词: RIPEMD-160算法, boomerang区分器, 模减差分, 充分条件, 消息修改

Abstract: SASAKI Y,et al used message modification technology to differentiate attack on 51-step RIPEMD-160(Lecture Notes in Computer Science,Vol.7341),but they did not consider the influence of modular subtraction difference on differential routes,and could not guarantee that the probability of the validation of the first half of the left and right operations is 1,which led to the error in the complexity of RIPEMD-160.For this reason,RIPEMD-160 differentiator is constructed by 2-dimension sums method and an improved distinguishing attack complexity analysis method is proposed.Sufficient conditions are given to ensure the validation of modular subtraction difference in differential routes.The probability of the validation of the first half of differential routes of left and right operations is increased from 2^-7.717 to 1 after message modification.The probability of the validation of differential routes of the second half is obtained through experimental tests.The analysis results show that the complexity of distinguishing attacks on 51-step RIPEMD-160 is 2^152.672.

Key words: RIPEMD-160 algorithm, boomerang distinguisher, modular subtraction difference, sufficient condition, message modification

中图分类号:

TP309

崔斌斌, 王高丽. 针对51步RIPEMD-160区分攻击的复杂度分析[J]. 计算机工程, 2019, 45(9): 147-152.

CUI Binbin, WANG Gaoli. Complexity Analysis of Distinguishing Attack on 51-step RIPEMD-160[J]. Computer Engineering, 2019, 45(9): 147-152.

https://www.ecice06.com/CN/Y2019/V45/I9/147

图/表 9

20190912184022

20190912184029

20190912184032

20190912184035

20190912184038

20190912184040

20190912184043

20190912184046

20190912184049

参考文献

[1] DOBBERTIN H,BOSSELAERS A,PRENEEL B.RIPEMD-160:a strengthened version of RIPEMD[C]//Proceedings of International Workshop on Fast Software Encryption.Cambridge,UK:[s.n.],1996:71-82.
[2] DAMGÅRD I B.A design principle for Hash functions[C]//Proceedings of Conference on the Theory and Application of Cryptology.Santa Barbara,USA:[s.n.],1989:416-427.
[3] MERKLE R C.One way Hash functions and DES[C]//Proceedings of Conference on the Theory and Application of Cryptology.Santa Barbara,USA:[s.n.],1989:428-446.
[4] MENDEL F,NAD T,SCHERZ S,et al.Differential attacks on reduced RIPEMD-160[C]//Proceedings of International Conference on Information Security.Seoul,Korea:[s.n.],2012:23-38.
[5] MENDEL F,PEYRIN T,SCHLÄFFER M,et al.Improved cryptanalysis of reduced RIPEMD-160[C]//Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.Bengaluru,India:[s.n.],2013:484-503.
[6] LIU Fukang,MENDEL F,WANG Gaoli.Collisions and semi-free-start collisions for round-reduced RIPEMD-160[C]//Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.Paris,France:[s.n.],2017:158-186.
[7] WANG Gaoli,SHEN Yanzhao,LIU Fukang.Cryptanalysis of 48-step RIPEMD-160[J].IACR Transactions on Symmetric Cryptology,2017(2):177-202.
[8] OHTAHARA C,SASAKI Y,SHIMOYAMA T.Preimage attacks on step-reduced RIPEMD-128 and RIPEMD-160[C]//Proceedings of International Conference on Information Security and Cryptology.Singapore:[s.n.],2010:169-186.
[9] 申延召.约减轮Hash函数HAS-160、RIPEMD-160和SM3的原像攻击[D].济南:山东大学,2018.
[10] SASAKI Y,WANG L.Distinguishers beyond three rounds of the RIPEMD-128/-160 compression functions[J].Lecture Notes in Computer Science,2012,7341:275-292.
[11] WAGNER D.The boomerang attack[C]//Proceedings of International Workshop on Fast Software Encryption.Rome,Italy:[s.n.],1999:156-170.
[12] BIRYUKOV A,NIKOLIC' I,ROY A.Boomerang attacks on BLAKE-32[C]//Proceedings of International Workshop on Fast Software Encryption.Lyngby,Denmark:[s.n.],2011:218-237.
[13] 吴广辉,于红波,郝泳霖.对约减轮数Skein-1024的Boomerang区分攻击[J].密码学报,2016,3(5):492-504.
[14] WANG Xiaoyun,LAI Xuejia,FENG Dengguo,et al.Cryptanalysis of the Hash functions MD4 and RIPEMD[C]//Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques.Aarhus,Denmark:[s.n.],2005:1-18.
[15] WANG Xiaoyun,YU Hongbo.How to break MD5 and other Hash functions[C]//Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques.Aarhus,Denmark:[s.n.],2005:19-35.
[16] WANG Xiaoyun,YIN Y L,YU Hongbo.Finding collisions in the full SHA-1[C]//Proceedings of Annual International Cryptology Conference.Santa Barbara,USA:[s.n.],2005:17-36.

选择文件类型/文献管理软件名称

选择包含的内容

针对51步RIPEMD-160区分攻击的复杂度分析

Complexity Analysis of Distinguishing Attack on 51-step RIPEMD-160

RichHTML

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 9

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	金海波, 赵欣越. 共形预测框架下的高可靠入侵检测算法[J]. 计算机工程, 2022, 48(7): 130-140.
[2]	丁晓晖, 曹素珍, 王彩芬. 智能合约辅助下满足前后向安全的动态可搜索加密方案[J]. 计算机工程, 2022, 48(7): 141-150.
[3]	张超, 彭长根, 丁红发, 许德权. 基于国密SM9的可搜索加密方案[J]. 计算机工程, 2022, 48(7): 159-167.
[4]	叶青, 赵楠楠, 赵宗渠, 秦攀科, 闫玺玺, 汤永利. 格上高效的完全动态群签名方案[J]. 计算机工程, 2021, 47(2): 160-167,175.
[5]	张静, 何铮, 葛炳辉, 汤永利, 叶青. 一种高效的百万富翁问题协议及其应用[J]. 计算机工程, 2021, 47(2): 168-175.
[6]	纪露生, 张桂玲, 杨佳润. 基于区块链的链下个人数据保护方案[J]. 计算机工程, 2021, 47(2): 176-181,187.
[7]	尤文珠, 葛海波. 利用多基数系统的高效椭圆曲线多标量乘算法[J]. 计算机工程, 2021, 47(2): 182-187.
[8]	张瑞, 陈红卫. 基于特征优化与SVPSO的工控入侵检测[J]. 计算机工程, 2020, 46(4): 19-25.
[9]	付子爔, 徐洋, 吴招娣, 许丹丹, 谢晓尧. 基于增量学习的SVM-KNN网络入侵检测方法[J]. 计算机工程, 2020, 46(4): 115-122.
[10]	李志, 宋礼鹏. 基于用户窗口行为的内部威胁检测研究[J]. 计算机工程, 2020, 46(4): 135-142,150.
[11]	刘雪艳, 贺啸梅, 芦婷婷, 罗玉坤. 无证书的共享数据公开审计方案[J]. 计算机工程, 2020, 46(4): 143-150.
[12]	曾娅琴, 张琳琳, 张若楠, 杨波. 基于MobileNet的恶意软件家族分类模型[J]. 计算机工程, 2020, 46(4): 162-168.
[13]	李远航, 陈先来, 刘莉, 安莹, 李忠民. 面向差分隐私保护的随机森林算法[J]. 计算机工程, 2020, 46(1): 93-101.
[14]	史志才, 王益涵, 张晓梅, 陈计伟, 陈珊珊. 一种具有隐私保护与前向安全的RFID组证明协议[J]. 计算机工程, 2020, 46(1): 108-113.
[15]	赵楠, 章国安, 谷晓会. VANET中隐私保护的无证书聚合签名方案[J]. 计算机工程, 2020, 46(1): 114-120,128.

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

针对51步RIPEMD-160区分攻击的复杂度分析

Complexity Analysis of Distinguishing Attack on 51-step RIPEMD-160

RichHTML

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 9

参考文献

相关文章 15

编辑推荐

Metrics

本文评价