摘要
文章提出了一种基于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.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第19期114-115,118,共3页
Computer Engineering and Applications
