| 对ARIA算法中间相遇攻击的改进 |
| |
| 引用本文： | 李曼曼,陈少真.对ARIA算法中间相遇攻击的改进[J].通信学报,2015,36(3):89-94. |
| |
| 作者姓名： | 李曼曼 陈少真 |
| |
| 作者单位： | 1. 解放军信息工程大学 网络空间安全学院，河南 郑州 450001；2. 数学工程与先进计算国家重点实验室，河南 郑州 450001 |
| |
| 基金项目： | 信息保障技术重点实验室开放基金资助项目（KJ-13-010） |
| |
| 摘 要： | 对ARIA算法的结构特征进行了研究，利用“多重集”并结合截断差分的性质，将预计算的参数由30个减少到16个，构造新的4轮中间相遇区分器，有效地改进了ARIA-192算法的7轮中间相遇攻击。新攻击的预计算复杂度为2135.3，时间复杂度约为2123。
|
| 关 键 词： | 分组密码 ARIA算法 中间相遇攻击 时间复杂度 |
Improved meet-in-the-middle attack on ARIA cipher |
| |
| Man-man LI,Shao-zhen CHEN.Improved meet-in-the-middle attack on ARIA cipher[J].Journal on Communications,2015,36(3):89-94. |
| |
| Authors: | Man-man LI Shao-zhen CHEN |
| |
| Affiliation: | 1. Institute of Cyberspace Security, The PLA Information Engineering University,Zhengzhou 450001,China;2. State Key Laboratory of Mathematical Engineering and Advanced Computing,Zhengzhou 450001,China |
| |
| Abstract: | A study on the structure of ARIA cipher is presented. A new 4-round distinguishing property for the meet-in-the-middle attack on ARIA cipher is presented by making use of the multiset and the truncated differential characteristic. The new distinguishing property improves the meet-in-the-middle attack on 7 rounds of ARIA-192 cipher effectively by reducing the 30 parameters to 16. The new attack requires a precomputation complexity of 2135.3 and a time complexity of about 2123. |
| |
| Keywords: | block cipher ARIA cipher meet-in-the-middle attack time complexity |
|
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
