| ARIRANG-256的Biclique攻击 |
| |
| 引用本文： | 卫宏儒,郑雅菲,王新宁.ARIRANG-256的Biclique攻击[J].计算机应用,2014,34(1):69-72. |
| |
| 作者姓名： | 卫宏儒 郑雅菲 王新宁 |
| |
| 作者单位： | 1. 北京科技大学 数理学院,北京 100083;
2. 北京科技大学 数理学院,北京 100083
3. 北京科技大学 基础学科教研室,北京 102100 |
| |
| 基金项目： | 国家自然科学基金资助项目;内蒙古自治区科技创新引导奖励基金资助项目 |
| |
| 摘 要： | 对SHA-3计划候选算法ARIRANG采用的分组密码ARIRANG-256进行了安全性分析。利用ARIRANG-256的密钥扩展与算法本身的加密结构,建立9轮32维的Bicliques,并利用建立的Bicliques给出完整40轮ARIRANG-256的Biclique攻击结果,数据复杂度为232,计算复杂度为2510.8。攻击对数据量的要求非常小且计算复杂度优于穷举搜索攻击,是Biclique攻击在分组密码全轮安全性分析中的又一次成功应用。
|
| 关 键 词： | 分组密码 ARIRANG-256 Biclique攻击 中间相遇 复杂度 |
| 收稿时间： | 2013-07-02 |
| 修稿时间： | 2013-09-04 |
Biclique cryptanalysis of ARIRANG-256 |
| |
| WEI Hongru ZHEN Yafei WANG Xinyu.Biclique cryptanalysis of ARIRANG-256[J].journal of Computer Applications,2014,34(1):69-72. |
| |
| Authors: | WEI Hongru ZHEN Yafei WANG Xinyu |
| |
| 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: | 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. |
| |
| Keywords: | block cipher ARIRANG-256 Biclique attack meet-in-the-middle complexity |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
