| 注册
首页|期刊导航|通信学报|对ARIA算法中间相遇攻击的改进

对ARIA算法中间相遇攻击的改进

李曼曼 陈少真

通信学报Issue(3):1-6,6.
通信学报Issue(3):1-6,6.DOI:10.11959/j.issn.1000-436x.2015062

对ARIA算法中间相遇攻击的改进

Improved meet-in-the-middle attack on ARIA cipher

李曼曼 1陈少真2

作者信息

  • 1. 解放军信息工程大学网络空间安全学院,河南郑州 450001
  • 2. 数学工程与先进计算国家重点实验室,河南郑州 450001
  • 折叠

摘要

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 char-acteristic. The new distinguishing property improves the meet-in-the-middle attack on 7 rounds of ARIA-192 cipher ef-fectively by reducing the 30 parameters to 16. The new attack requires a precomputation complexity of 2135.3 and a time complexity of about 2123.

关键词

分组密码/ARIA算法/中间相遇攻击/时间复杂度

Key words

block cipher/ARIA cipher/meet-in-the-middle attack/time complexity

分类

信息技术与安全科学

引用本文复制引用

李曼曼,陈少真..对ARIA算法中间相遇攻击的改进[J].通信学报,2015,(3):1-6,6.

基金项目

信息保障技术重点实验室开放基金资助项目(KJ-13-010)Foundation Item:Foundation of Science and Technology on Information Assurance Laboratory (KJ-13-010) (KJ-13-010)

通信学报

OA北大核心CSCDCSTPCD

1000-436X

访问量0
|
下载量0
段落导航相关论文