对完整轮数ARIRANG加密模式的新的相关密钥矩形攻击  

New Related-key Rectangle Attack on Full ARIRANG Encryption Mode

作　　者：刘青[1] 卫宏儒[1,2] 

机构地区：[1]北京科技大学数理学院,北京100083 [2]信息安全国家重点实验室,北京100191

出　　处：《计算机科学》2013年第8期109-114,共6页Computer Science

基　　金：信息安全国家重点实验室2011年开放课题(02-04-3);内蒙古自治区科技创新引导奖励资金(2012)资助

摘　　要：针对ARIRANG加密模式,利用相关密钥矩形攻击的方法对其安全性进行了重新评估。首先找到了一些新的38轮和39轮的高概率相关密钥矩形区分器,然后在此基础上将区分器进行改进,改进的主要思想是:利用模减差分和异或差分的混合表示方式代替原先的异或差分,同时在区分器的输出中选择一个差分集合代替原先单一的差分。基于以上各种新的高概率区分器,对全轮ARIRANG加密模式进行了攻击,其结果优于以往的攻击结果。其中最好的攻击结果为:攻击全轮的ARIRANG-256加密模式所需的数据复杂度和时间复杂度分别为2220.79和2155.60。The security of ARIRANG encryption mode was revaluated with the method of related-key rectangle attack. First, some new high-probability related-key rectangle distinguishers of 38 rounds and 39 rounds were found. Based on these distinguishers, some improvements in them were made. The main idea is the use of modular subtraction and XOR differential instead of the only XOR differential. Also,outputs of the distinguishers chose a differential set instead of the only XOR differential. All kinds of results based on these new high-probability distinguishers are presented, and they are better than the previous results. The best result is the attack on full ARIRANG-256 encryption mode with the data complexity and time complexity of 2 220.79 and 2 155.60, respectively.

关 键 词：ARIRANG加密模式 相关密钥矩形攻击 区分器 模减差分 差分集合 

分 类 号：TN918.1[电子电信—通信与信息系统]