快速模幂算法及其硬件实现  

Fast Modular Exponentiation Algorithm and Its Hardware Implementation

作　　者：周芬[1] 高志强[1] 

机构地区：[1]清华大学微电子研究所设计室,北京 100084

出　　处：《微电子学》2000年第6期391-394,共4页Microelectronics

摘　　要：RSA公开密钥加密技术是目前使用最广泛的加密技术。文章提出了快速并行的算法 ,使RSA公开密钥加密速度提高了很多。模乘算法是模幂算法的核心 ,基于 Montgomery算法 ,提出了一种改进的快速高基模乘算法 ,该算法求出了乘法的最终积 ,使得乘法和模减运算同时进行 ,并且所有的运算是以字节为单位。模幂算法采用从右到左扫描指数的方法 ,可以使得两次模乘运算同时进行。算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。对于 51 2位操作数 ,在 1 0 0 MHz时钟频率下 ,加密速率约为 390RSA public key crypto-system is a relatively safe technology,which is widely used in today’s secure electronic communication.In this paper,the parallelity of the algorit hm is improved in many ways,so the encryption rate increases.Modular multiplication algorithm is the core of modular exponentiation.A fast modular multiplication algorithm based on Montgomery’s algorithm is proposed .In the improved algorithm,the final product of the multip lication is calculated,which makes multiplication and modular reductio n run at the same time.All the operations are based on words.Modul ar exponentiation algorithm scans encryption from right to left,so t wo modular multiplications can be processed parallelly.The hardware arc hitecture is made up of modular controller,modular exponentiation contr oller,data register,and modular multiplication operation units.At a cl ock of 100 MHz,the encryption rate is about 390 kb/s for 51 2-b operands.

关 键 词：模幂算法 模乘算法 公开密钥加密 网络数据安全 

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