针对RSA算法的踪迹驱动数据Cache计时攻击研究

发布时间：2018-07-04 21:28

本文选题：RSA密码算法 + 旁路攻击　；参考：《计算机学报》2014年05期

【摘要】：Cache计时攻击是旁路攻击领域的研究热点.针对滑动窗口算法实现模幂运算的RSA算法,分析了RSA算法访问驱动Cache计时攻击的难点,建立了踪迹驱动数据Cache计时攻击模型.在攻击模型与原有踪迹驱动计时攻击算法的基础上,利用幂指数与操作序列的相关性、窗口大小特征和预计算表索引值与窗口值的映射关系,提出了一种改进的幂指数分析算法,并给出了利用幂指数dp和dq的部分离散位恢复出私钥d的格攻击过程.利用处理器的同步多线程能力实现了间谍进程与密码进程的同步执行,针对OpenSSL v0.9.8b中的RSA算法,在真实环境下执行攻击实验.实验结果表明:新的分析算法大约能够获取512位幂指数中的340位,比原有算法进一步降低了密钥恢复的复杂度;同时对实际攻击中的关键技术以及可能遇到的困难进行分析,给出相应的解决方案,进一步提高了攻击的可行性.
[Abstract]:Cache timing attack is a hotspot in the field of bypass attack. Aiming at the RSA algorithm which realizes modular exponentiation in sliding window algorithm, this paper analyzes the difficulties of RSA algorithm access driven cache timing attack, and establishes the trace driven data cache timing attack model. Based on the attack model and the original trace-driven timing attack algorithm, the correlation between power exponent and operation sequence, window size feature and mapping relation between index value and window value of pre-calculated table are used. An improved power exponent analysis algorithm is proposed, and the lattice attack process of recovering the private key d by using the partial discrete bits of power exponent DP and dq is given. The synchronous execution of the spyware process and the cryptographic process is realized by using the synchronous multithread ability of the processor. The attack experiment is carried out in real environment against the RSA algorithm in OpenSSL v0.9.8b. The experimental results show that the new algorithm can obtain 340 bits of 512 power exponents, which further reduces the complexity of key recovery, and analyzes the key technologies and difficulties in actual attacks. The corresponding solutions are given to further improve the feasibility of the attack.
【作者单位】：装甲兵工程学院科研部;军械工程学院信息工程系;北方电子设备研究所;
【基金】：国家自然科学基金(60772082) 河北省自然科学基金数学研究专项(08M010)资助~~
【分类号】：TN918.4

【参考文献】