摘要： 研究RSA签名算法和Cache计时攻击原理，分析OpenSSL0.9.8a中的RSA实现过程，针对RSA滑动窗口算法中的访问初始化表操作，提出一种Cache计时攻击方法。实验结果表明，该方法在1次攻击中可获得1 024 bit密钥中700 bit以上的密钥，与传统基于统计方法的计时攻击相比，所需样本更少。

关键词: RSA密码算法, Cache计时攻击, 滑动窗口算法, 平方-乘法算法, 微架构分析

Abstract: Based on researching RSA signature algorithm and theory of cache timing attack, analyzing the implementation of RSA in OpenSSL0.9.8a, a caching timing attack method is given against the process of accessing initial table in the sliding windows algorithm. Simulation result demonstrates the cache timing attack can get more than 700 bit secret key from 1 024 bit private key and needs less samples compare to the timing attack based on statistic analysis.

Key words: RSA cipher algorithm, Cache timing attack, sliding window algorithm, square and multiplication algorithm, microarchitectual analysis

中图分类号: 

• TN918