一种Montgomery模幂乘硬件流水线实现算法  

A Montgomery's Modular Multiplication Hardware Pipeline Imple men tation Algorithm

作　　者：李占才[1] 涂序彦[1] 等 

机构地区：[1]北京科技大学计算机系，北京100083

出　　处：《计算机工程与应用》2002年第19期114-115,118,共3页Computer Engineering and Applications

摘　　要：文章提出了一种基于Montgomery算法的模幂乘硬件流水线实现算法,该算法的核心是把模N乘上一个系数,使倍增后的模之低若干位(二进制)全为1,然后用倍增后的模进行Montgomery算法模幂乘运算。采用该算法,可以设计出用于实现RSA的高频流水线运算部件。A Montgomery's modular multiplication hardware pipeline implementation algorithm is proposed in the paper.The heart of the algorithm is to scale the modulus N so as to make the scaled modulus some least significant bits(bi-nary)all equal1,then to perform the Montgomery's modular multiplication by using the scaled modulus.Based on this algorithm,a high-speed pipeline unit for performing RSA can be designed.

关 键 词：模幂乘硬件流水线实现算法 MONTGOMERY算法 RSA算法 信息安全 

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