对8轮ARIA算法的差分枚举攻击  

Differential Enumeration Attack on ARIA

作　　者：陈少真[1] 鲁林真[1] 

机构地区：[1]解放军信息工程大学信息工程学院,郑州450002

出　　处：《电子与信息学报》2011年第7期1770-1774,共5页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60833008)资助课题

摘　　要：给出了ARIA算法4轮差分性质,提出了对ARIA算法的差分枚举攻击。攻击了7轮和8轮ARIA-256算法,攻击的数据复杂度是256,攻击7轮时预计算的复杂度为2238.2次加密7轮ARIA算法,恢复密钥的计算复杂度是2124.2次加密7轮ARIA算法;攻击8轮时预计算的复杂度为2238次加密8轮ARIA算法,恢复密钥的计算复杂度是2253.6次加密8轮ARIA算法。The 4-round ARIA differential property is given,and the differential enumeration attack on 7-round and 8-round ARIA-256 is presented in this paper.The attacks need 256 chosen plaintexts.The attack on 7-round ARIA has the time complexity of 2238.2 7-round ARIA encryptions in the preprocessing phase and 2124.2 7-round ARIA encryptions in the processing phase.The attack on 8-round ARIA has the time complexity of 2238 8-round ARIA encryptions in the preprocessing phase and 2253.6 8-round ARIA encryptions in the processing phase.

关 键 词：分组密码 ARIA 差分分析 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]