An Improved Simple Power Attack against Camellia's Key Schedule

作     者：LIU Shuanggen NI Haiying HU Yupu LIAO Yunyan 

作者机构：Key Laboratory of Computer Network and InformationSecurity of Ministry of Education Xidian University Xi＇an710071 Shaanxi China College of Computer Information Engineering JiangxiNormal University Nanchang 330022 Jiangxi China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2008年第13卷第5期

页      面：591-594页

学科分类：0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：the National Natural Science Foundation of China (60673072) the Natural Basic Research Program of China (2007CB311201) 

主　　题：simple power attack Camellia key schedule Hamming weight attack 

摘      要：This paper presents an improved simple power attack against the key schedule of Camellia. While the original attack required an exact determination of the Hamming weight of intermediate data values based on power measurements, in this paper, two types of the simple power attack are presented and shown to be tolerant of errors that might occur in the Hamming weight determinations. In practical applications of the attack, such errors are likely to occur due to noise and distortion in the power measurements and their mapping to the Hamming weights of the data. To resist these attacks, the required design rationale of key schedules and several practical countermeasures are suggested.