王涛,,
袁庆军,
高杨,
王相宾
1.战略支援部队信息工程大学 郑州 450001
2.河南省网络密码技术重点实验室 郑州 450001
基金项目:国家自然科学基金(61872381, 61602512)
详细信息
作者简介:王永娟：女，1972年生，副教授，主要研究方向为网络空间安全、密码算法分析
王涛：男，1995年生，硕士生，研究方向为侧信道攻击
袁庆军：男，1993年生，助教，研究方向为侧信道攻击
高杨：男，1994年生，硕士生，研究方向为故障攻击
王相宾：男，1996年生，硕士生，研究方向为侧信道攻击
通讯作者:王涛 1072637697@qq.com
中图分类号:TP309.7计量
文章访问数:2046
HTML全文浏览量:542
PDF下载量:48
被引次数:0
出版历程
收稿日期:2018-11-23
修回日期:2019-11-27
网络出版日期:2020-03-25
刊出日期:2020-06-04
Side Channel Cube Attack Improvement and Application to Cryptographic Algorithm
Yongjuan WANG,Tao WANG,,
Qingjun YUAN,
Yang GAO,
Xiangbin WANG
1. PLA Strategic Support Force Information Engineering University, Zhengzhou 450001, China
2. Henan Key Laboratory of Network Cryptography Technology, Zhengzhou 450001, China
Funds:The National Natural Science Foundation of China(61872381, 61602512)
摘要
摘要:立方攻击的预处理阶段复杂度随输出比特代数次数的增长呈指数级增长，寻找有效立方集合的难度也随之增加。该文对立方攻击中预处理阶段的算法做了改进，在立方集合搜索时，由随机搜索变为带目标的搜索，设计了一个新的目标搜索优化算法，优化了预处理阶段的计算复杂度，进而使离线阶段时间复杂度显著降低。将改进的立方攻击结合旁路方法应用在MIBS分组密码算法上，从旁路攻击的角度分析MIBS的算法特点，在第3轮选择了泄露位置，建立关于初始密钥和输出比特的超定的线性方程组，可以直接恢复33 bit密钥，利用二次检测恢复6 bit密钥。所需选择明文量221.64，时间复杂度225。该结果较现有结果有较大改进，恢复的密钥数增多，在线阶段的时间复杂度降低。
关键词:立方攻击/
旁路攻击/
预处理/
二次检测/
MIBS算法
Abstract:The complexity of the pre-processing phase of the cubic attack grows exponentially with the number of output bit algebras, and the difficulty of finding an effective cube set increases. In this paper, the algorithm of preprocessing stage in cubic attack is improved. In the cube set search, from random search to target search, a new target search optimization algorithm is designed to optimize the computational complexity of the preprocessing stage. In turn, the offline phase time complexity is significantly reduced. The improved cubic attack combined with the side-channel method is applied to the MIBS block cipher algorithm. The algorithm characteristics of MIBS are analyzed from the perspective of side-channel attack. The leak location is selected in the third round, and the overdetermined linear equations from initial key and output bit are established, which can directly recover 33bit key. Then the 6bit key can be recovered by quadric-detecting. The amount of plaintext required is 221.64, time complexity is 225. This result is greatly improved compared with the existing results, the number of keys recovered is increased, and the time complexity of the online phase is reduced.
Key words:Cube attack/
Side channel attack/
Preprocessing/
Quadric-detecting/
MIBS algorithm
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=8c6c2e79-aaa9-4c04-8382-25cfa8fb9e3d
