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

发布时间：2018-04-13 03:06

本文选题：秘密共享 + AES　；参考：《工程科学与技术》2017年01期

【摘要】：针对构建新的密码结构抵抗DPA攻击尤其是glitch攻击的问题,通过将输入变换到复合域GF(((22)2)2)求逆,再变换回有限域GF(28)输出的方法构造了一个低消耗的AES的S盒;并基于秘密共享的思想分仿射变换、求逆变换、逆仿射变换3步对S盒进行分组,得到一个新的S盒。新的S盒在求逆变换中采用4×4的正确项分组法,相比于Nikova提出的经典方案,减少了实现所占用的空间,降低了消耗。通过分析验证,本文方案具有较为优良的消耗特性,且对1阶DPA攻击及glitch攻击具有与Nikova方案同等级的抵抗能力。
[Abstract]:Aiming at the problem of constructing a new cryptosystem to resist DPA attacks, especially glitch attacks, a low cost S-box of AES is constructed by converting the input to the complex domain GFN22 / 2 / 2) and then converting it back to the finite field GFN 28) output.Based on the idea of secret sharing, a new S-box is obtained by dividing the affine transformation, solving the inverse transformation and inverse affine transformation in three steps.The correct item grouping method of 4 脳 4 is used in the new S-box inversion. Compared with the classical scheme proposed by Nikova, the space occupied by the new S-box is reduced and the consumption is reduced.Through analysis and verification, it is proved that the proposed scheme has better consumption characteristics and has the same level of resistance to the first order DPA attack and glitch attack as the Nikova scheme.
【作者单位】：网络与信息安全武警部队重点实验室;武警工程大学电子技术系;
【基金】：国家自然科学基金资助项目(61272492;61103230)
【分类号】：TP309

【相似文献】