摘要
蒙哥马利模乘算法是最适合硬件实现的模乘算法,被应用在RSA密码和ECC密码的协处理器设计中。目前性能最高的是高基蒙哥马利模乘算法,分析了高基蒙哥马利算法的实现,提出了一种新的基于高基阵列乘法器的Montgomery模乘高速硬件实现结构,基于这种结构位长为n的比特模乘仅需要约n/w+6个时钟周期,该结构设计的电路只与最小单元有关,在硬件实现时可以大大提高频率,并提高设计的性能,可以设计高速的RSA和椭圆曲线密码大规模集成电路。
Montgomery modular multiplication algorithm is best suited for fast hardware implementation, which is used widely in the design of RSA/ECC processor.Now, the high-radix Montgomery modular multiplication algorithm is the high-speed algorithm.The implementation of Montgomery modular multiplication algorithm is analyzed.A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication.Using a radix 2w, a n-bit modular multiplication only takes about n/w＋6 cycles.This leads to a competitive ASIC implementation for RSA and elliptic curve cryptography（ECC）.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第6期1202-1204,1208,共4页
Computer Engineering and Design
