| 7轮ARIA-256的不可能差分新攻击 |
| |
| 引用本文： | 苏崇茂.7轮ARIA-256的不可能差分新攻击[J].计算机应用,2012,32(1):45-48. |
| |
| 作者姓名： | 苏崇茂 |
| |
| 作者单位： | 1. 桂林电子科技大学 信息与通信学院，广西 桂林 541004
2. 综合业务网理论及关键技术国家重点实验室(西安电子科技大学)，西安 710071 |
| |
| 基金项目： | 国家自然科学基金资助项目(60872038);广西自然科学基金资助项目(2011GXNSFB018071);ISN国家重点实验室开放课题基金资助项目(11-11);广西信息与通讯技术重点实验室主任基金资助项目(10908);广西研究生教育创新计划项目(2010105950810M15);广西无线宽带通信与信号处理重点实验室基金资助项目(11102) |
| |
| 摘 要： | 如何针对分组密码标准ARIA给出新的安全性分析是当前的研究热点。基于ARIA的算法结构，利用中间相遇的思想设计了一个新的4轮不可能差分区分器。基于该区分器，结合ARIA算法特点，在前面加2轮，后面加1轮，构成7轮ARIA-256的新攻击。研究结果表明：攻击7轮ARIA-256所需的数据复杂度约为2120选择明文数据量，所需的时间复杂度约为2219次7轮ARIA-256加密。与已有的7轮ARIA-256不可能差分攻击结果相比较，新攻击进一步地降低了所需的数据复杂度和时间复杂度。
|
| 关 键 词： | 分组密码 ARIA算法 不可能差分攻击 时间复杂度 |
| 收稿时间： | 2011-08-08 |
| 修稿时间： | 2011-09-18 |
New impossible deferential attack on 7-round reduced ARIA |
| |
| SU Chong-mao.New impossible deferential attack on 7-round reduced ARIA[J].journal of Computer Applications,2012,32(1):45-48. |
| |
| Authors: | SU Chong-mao |
| |
| Affiliation: | 1. School of Information and Communication, Guilin University of Electronic Technology, Guilin Guangxi 541004, China;
2. State Key Laboratory of Integrated Services Networks (Xidian University), Xi'an Shaanxi 710071, China |
| |
| Abstract: | How to give new security comments on the standard block cipher ARIA is a current hot issue. Based on the structure of ARIA cipher, a new 4-round distinguisher was designed by adopting meet-in-the-middle principle. Based on this distinguisher, and combining the features of ARIA algorithm, a new attack on 7-round ARIA-256 was proposed by adding 2-round at the beginning and 1-round at the end. It is shown that the new attack requires a data complexity of about 2120 chosen plaintexts and a time complexity of about 2219 7-round ARIA-256 encryptions. Compared with the previous known impossible differential attacks，the new attack efficiently reduces the data complexity and time complexity. |
| |
| Keywords: | block cipher ARIA algorithm impossible differential attack time complexity |
|
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
