Journal of Computer Applications ›› 2014, Vol. 34 ›› Issue (1): 69-72.DOI: 10.11772/j.issn.1001-9081.2014.01.0069
• Network and distributed techno • Previous Articles Next Articles
WEI Hongru1,ZHEN Yafei1,WANG Xinyu2
Received:
Revised:
Online:
Published:
Contact:
卫宏儒1,郑雅菲2,王新宁3
通讯作者:
作者简介:
基金资助:
国家自然科学基金资助项目;内蒙古自治区科技创新引导奖励基金资助项目
Abstract: The security of block cipher ARIRANG-256 used in the compression function of ARIRANG, which was one candidate of SHA-3, was analyzed. Based on the key schedule and the encryption structure of the algorithm, 9-round 32 dimensional Bicliques were constructed, and under these Bicliques, full 40-round ARIRANG-256 was attacked. The data complexity is 232 and the time complexity is 2510.8. The attack has very small data requirement and its time complexity is better than exhaustive search.
Key words: block cipher, ARIRANG-256, Biclique attack, meet-in-the-middle, complexity
摘要: 对SHA-3计划候选算法ARIRANG采用的分组密码ARIRANG-256进行了安全性分析。利用ARIRANG-256的密钥扩展与算法本身的加密结构,建立9轮32维的Bicliques,并利用建立的Bicliques给出完整40轮ARIRANG-256的Biclique攻击结果,数据复杂度为232,计算复杂度为2510.8。攻击对数据量的要求非常小且计算复杂度优于穷举搜索攻击,是Biclique攻击在分组密码全轮安全性分析中的又一次成功应用。
关键词: 分组密码, ARIRANG-256, Biclique攻击, 中间相遇, 复杂度
CLC Number:
TP309.7
WEI Hongru ZHEN Yafei WANG Xinyu. Biclique cryptanalysis of ARIRANG-256[J]. Journal of Computer Applications, 2014, 34(1): 69-72.
卫宏儒 郑雅菲 王新宁. ARIRANG-256的Biclique攻击[J]. 计算机应用, 2014, 34(1): 69-72.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://www.joca.cn/EN/10.11772/j.issn.1001-9081.2014.01.0069
http://www.joca.cn/EN/Y2014/V34/I1/69