ARIRANG-256的Biclique攻击  

Biclique cryptanalysis of ARIRANG-256

作　　者：卫宏儒[1] 郑雅菲 王新宁[2] 

机构地区：[1]北京科技大学数理学院,北京100083 [2]北京科技大学基础学科教研室,北京102100

出　　处：《计算机应用》2014年第1期69-72,112,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61272476);内蒙古自治区科技创新引导奖励基金资助项目(2012)

摘　　要：对SHA-3计划候选算法ARIRANG采用的分组密码ARIRANG-256进行了安全性分析。利用ARIRANG-256的密钥扩展与算法本身的加密结构,建立9轮32维的Bicliques,并利用建立的Bicliques给出完整40轮ARIRANG-256的Biclique攻击结果,数据复杂度为232,计算复杂度为2510.8。攻击对数据量的要求非常小且计算复杂度优于穷举搜索攻击,是Biclique攻击在分组密码全轮安全性分析中的又一次成功应用。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 2^510.8. The attack has very small data requirement and its time complexity is better than exhaustive search.

关 键 词：分组密码 ARIRANG-256 Biclique攻击 中间相遇 复杂度 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]