基于秘密共享的AES的S盒实现与优化  

Implementation and Optimization of S-box on AES Based on Secret Sharing

作　　者：钟卫东[1,2] 孟庆全 张帅伟 汪晶晶[1] 

机构地区：[1]网络与信息安全武警部队重点实验室,陕西西安710086 [2]武警工程大学电子技术系,陕西西安710086

出　　处：《工程科学与技术》2017年第1期191-196,共6页Advanced Engineering Sciences

基　　金：国家自然科学基金资助项目(61272492;61103230)

摘　　要：针对构建新的密码结构抵抗DPA攻击尤其是glitch攻击的问题,通过将输入变换到复合域GF(((22)2)2)求逆,再变换回有限域GF(28)输出的方法构造了一个低消耗的AES的S盒;并基于秘密共享的思想分仿射变换、求逆变换、逆仿射变换3步对S盒进行分组,得到一个新的S盒。新的S盒在求逆变换中采用4×4的正确项分组法,相比于Nikova提出的经典方案,减少了实现所占用的空间,降低了消耗。通过分析验证,本文方案具有较为优良的消耗特性,且对1阶DPA攻击及glitch攻击具有与Nikova方案同等级的抵抗能力。DPA is widely used in the present as a new type of password attack technology, especially the most widely used glitch attack, which can break a large number of existing password program. In this paper, to resist DPA attacks especially glitch attacks, a new password structure of a low-consumption S-box based on AES was constructed by converting inputs into the composite field for seeking inverse, and converting them back to finite field for outputs. Then based on the idea of secret sharing, a new one was obtained by grouping S-box through the steps of affine transformation, inversion transformation and inverse-affine transformation. Compared to the classical scheme proposed by Nikova Svetla,the occupied space and consumption were reduced by using the method of correction terms. The analysis and experiments showed that the proposed scheme has better consumption characteristics, and the same level of resistance for first order DPA attack and glitch attack compared with the scheme of Nikova Svetla.

关 键 词：秘密共享 AES 1阶DPA攻击 glitch攻击 S盒 

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