抵御简单功耗分析的RSA模幂算法实现  

Implementation of SPA Resistant RSA Exponentiation Algorithm

作　　者：范黎恒[1] 陈开颜[1] 张鹏[1] 赵强[1] 

机构地区：[1]军械工程学院计算机工程系,石家庄050003

出　　处：《微电子学与计算机》2009年第6期227-229,共3页Microelectronics & Computer

基　　金：国家自然科学基金项目(60571037);国家"八六三"计划项目(2007AA01Z454)

摘　　要：通过分析加法链模幂算法,发现其不仅能提高RSA的加密速度,而且可以抵御SPA攻击.实验证明了加法链模幂算法可以抵御SPA攻击.将加法链模幂算法与RSA的SPA攻击常用防护方法进行对比,说明了加法链模幂算法的特点和优势.By analyzing the addition chain exponentiation algorithm, it is found that not only the speed of RSA encryption can be accelerated, but also SPA attack can be resistant with this algorithm. Experiment is proved that the algorithm can resistant SPA attack. Compared with general countermeasures of RSA against SPA attack, the characteristic and advances of this algorithm were explained.

关 键 词：RSA 简单功耗分析 模幂算法 加法链 

分 类 号：TP309[自动化与计算机技术—计算机系统结构] TN492[自动化与计算机技术—计算机科学与技术]