首页 | 官方网站   微博 | 高级检索  
     

Zodiac算法的碰撞攻击
引用本文:刘 青,卫宏儒,潘 伟.Zodiac算法的碰撞攻击[J].计算机应用,2014,34(1):73-77.
作者姓名:刘 青  卫宏儒  潘 伟
作者单位:1. 北京科技大学 数理学院,北京 100083; 2. 北京科技大学 基础学科教研室,北京 102100
基金项目:国家自然科学基金资助项目;内蒙古自治区科技创新引导奖励基金资助项目
摘    要:为了研究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算法均不能抵抗碰撞攻击。

收稿时间:2013-07-02
修稿时间:2013-08-31

Collision attack on Zodiac algorithm
LIU Qing WEI Hongru PAN Wei.Collision attack on Zodiac algorithm[J].journal of Computer Applications,2014,34(1):73-77.
Authors:LIU Qing WEI Hongru PAN Wei
Affiliation: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
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.
Keywords:
本文献已被 CNKI 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号