Zodiac算法的碰撞攻击

doi:10.11772/j.issn.1001-9081.2014.01.0073

计算机应用 ›› 2014, Vol. 34 ›› Issue (1): 73-77.DOI: 10.11772/j.issn.1001-9081.2014.01.0073

Zodiac算法的碰撞攻击

刘青¹,卫宏儒¹,潘伟²

1. 北京科技大学数理学院,北京 100083;
2. 北京科技大学基础学科教研室,北京 102100

收稿日期:2013-07-02 修回日期:2013-08-31 出版日期:2014-01-01 发布日期:2014-02-14
通讯作者: 卫宏儒
作者简介:刘青(1989-),女,山西大同人,硕士研究生,主要研究方向:密码学;卫宏儒(1963-),男,陕西宝鸡人,副教授,主要研究方向:数学、信息安全、密码学、物联网;潘伟(1976-),男,北京人,讲师,硕士,主要研究方向:网络、信息安全、物联网。
基金资助:
国家自然科学基金资助项目;内蒙古自治区科技创新引导奖励基金资助项目

Collision attack on Zodiac algorithm

LIU Qing¹,WEI Hongru¹,PAN Wei²

1. School of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083, China;
2. Department of Basic Courses, University of Science and Technology Beijing, Beijing 102100, China

Received:2013-07-02 Revised:2013-08-31 Online:2014-01-01 Published:2014-02-14
Contact: WEI Hongru

摘要/Abstract

摘要： 为了研究Zodiac算法抵抗碰撞攻击的能力,根据算法的一个等价结构,分别给出了Zodiac算法的两个8轮和9轮区分器。通过在此区分器前后加适当的轮数,首先,利用9轮区分器对12轮到16轮的算法进行了碰撞攻击,其攻击的数据复杂度分别为215,231.2,231.5,231.7,263.9,时间复杂度分别为233.8,249.9,275.1,2108,2140.1;其次,利用8轮区分器对全轮算法进行了攻击,其攻击的数据复杂度和时间复杂度分别为260.6和2173.9。结果表明:全轮的Zodiac-192/256算法均不能抵抗碰撞攻击。

关键词: Zodiac算法, 碰撞攻击, 等价结构, 区分器, 数据复杂度, 时间复杂度

Abstract: In order to research the ability of Zodiac algorithm against the collision attack, two 8-round and 9-round distinguishers of Zodiac algorithm based on an equivalent structure of it were proposed. Firstly, collision attacks were applied to the algorithm from 12-round to 16-round by adding proper rounds before or after the 9-round distinguishers. The data complexities were 215, 231.2, 231.5, 231.7and 263.9, and the time complexities were 233.8, 249.9, 275.1, 2108and 2140.1, respectively. Then the 8-round distinguishers were applied to the full-round algorithm. The data complexity and time complexity were 260.6 and 2173.9, respectively. These results show that both full-round Zodiac-192 and full-round Zodiac-256 are not immune to collision attack.

Key words: Zodiac algorithm, collision attack, equivalent structure, distinguisher, data complexity, time complexity

中图分类号:

TP309.7

刘青卫宏儒潘伟. Zodiac算法的碰撞攻击[J]. 计算机应用, 2014, 34(1): 73-77.

LIU Qing WEI Hongru PAN Wei. Collision attack on Zodiac algorithm[J]. Journal of Computer Applications, 2014, 34(1): 73-77.

[1]	左黎明, 陈祚松, 夏萍萍, 易传佳. 高效的可证安全短代理签名方案[J]. 计算机应用, 2018, 38(12): 3455-3461.
[2]	刘晓强, 韦永壮, 刘争红. 新的低轮Keccak线性结构设计[J]. 计算机应用, 2018, 38(10): 2934-2939.
[3]	李灵琛, 韦永壮, 朱嘉良. 11轮3D分组密码算法的中间相遇攻击[J]. 计算机应用, 2015, 35(3): 700-703.
[4]	翟东海左文杰段维夏鱼江李同亮. 基于双十字曲率驱动扩散模型的图像修复算法[J]. 计算机应用, 2013, 33(12): 3536-3539.
[5]	姜阳吕学强李琳施水才. 基于扩展射线法的三维模型检索[J]. 计算机应用, 2013, 33(02): 463-467.
[6]	武鹏李美安. 具有O(n)时间复杂度的分布式请求集生成算法[J]. 计算机应用, 2013, 33(02): 323-360.
[7]	陈景霞李建文. 新的全球定位系统弱信号高灵敏捕获算法[J]. 计算机应用, 2012, 32(11): 3262-3267.
[8]	苏崇茂. 7轮ARIA-256的不可能差分新攻击[J]. 计算机应用, 2012, 32(01): 45-48.
[9]	滕聪. 切换到高一层路网最近四个点的最短路算法[J]. 计算机应用, 2010, 30(11): 2880-2883.
[10]	张绍兰邢国波杨义先. 对MD5的改进及其安全性分析[J]. 计算机应用, 2009, 29(4): 947-949.
[11]	杨邦任立良贺颖庆. 基于快速排序的数字高程模型分级填洼算法[J]. 计算机应用, 2009, 29(11): 3161-3164.

Zodiac算法的碰撞攻击

Collision attack on Zodiac algorithm

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 11

编辑推荐

Metrics