论文部分内容阅读
提出了针对从右到左平方乘算法实现的RSA故障分析算法,该算法利用多次在模幂运算执行过程中在不同指定位置对模数N注入故障获得的故障签名,通过密钥搜索恢复出参与故障运算的密钥片断,最终恢复完整密钥。从理论上分析了该算法的复杂度,并通过仿真实验进行了验证,得到了密钥搜索空间和所需注入故障数目与一次攻击恢复密钥片断长度之间的对应关系。
A RSA fault analysis algorithm based on the right-to-left square multiplication algorithm is proposed. This algorithm takes advantage of the fault signature obtained by injecting a fault into module N several times during the execution of modular exponentiation, and retrieves the key signature by key search Participate in the operation of the key piece of failure, the final recovery of the complete key. The complexity of this algorithm is theoretically analyzed and verified through simulation experiments. The corresponding relationship between the key search space and the number of required injection failures and the length of an attack recovery key piece is obtained.