基于Montgomery算法的RSA密码协处理器设计  

RSA Cryptography Coprocessor Based on Modified Montgomery Algorithm

作　　者：曾为民 刘晶晶[2] 陈光化[2] 马世伟[2] 

机构地区：[1]上海华翼泉芯微电子技术有限公司,上海200120 [2]上海大学机电工程与自动化学院,上海200072

出　　处：《微电子学与计算机》2015年第8期115-119,124,共6页Microelectronics & Computer

摘　　要：为了提高RSA协处理器的加解密速度,在传统的Montgomery算法的基础上,提出一种从右到左扫描的高基快速模乘算法.该方案通过减少一个减法器和一个移位寄存器并预先计算两个值,从而减少了迭代的次数.改进后的模幂算法消除了由Montgomery迭代引起的额外因子R-1,从而大大减少了硬件电路的复杂性,从右到左的扫描法有效缩短了大数模幂运算的时间.实验结果表明:在电路面积没有增加的情况下,基于0.18μm CSMC标准单元库工艺下,在10 MHz的时钟频率下,RSA密码协处理器加密1024位的明文平均仅需330ms,等效单元门为26kgate.较之其他设计,在速度和面积上都有一定的优势.In order to speed up the operation of RSA coprocessor,an advanced high radix Montgomery module multiplication and Reft-to-Light scan modular exponentiation algorithm are proposed.The modified Montgomery module multiplication eliminates the carry propagation and decreases the number of iteration.The modified modular exponentiation algorithm eliminates the unwanted effect of the factor R-1 which is introduced by Montgomery modular multiplication.A high performance scalable public-key cipher RSA coprocessor is designed,which is based on them.The result of the hardware implementation shows that the improved RSA coprocessor is synthesized by CSMC 0.18μm library,and the total logic resources is 26 kgates,Simulation result shows that it takes an average of 330 ms to complete a 1024 bit encryption at 10 MHz.Compared with previous works,the proposed architecture can achieve better performance in chip area and speed.

关 键 词：RSA协处理器 MONTGOMERY算法 模乘算法 从右到左的扫描算法 

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