摘要： 在改进基于字的Montgomery模乘算法的基础上，通过优化流水线结构缩短关键路径，实现了一种结构优化的模乘器。设计中采用了按字运算的高基Montgomery模乘算法，使该设计具有良好的可扩展性，可以完成任意位数的模乘运算。改进了模乘器的流水线结构，提高了模乘器的工作效率。该设计可以应用于各种高性能且低成本的RSA密码协处理器设计。

关键词: RSA, Montgomery模乘算法, 流水线, 可伸缩, VLSI

Abstract: This paper proposes a modified multiple-word radix-2k Montgomery multiplication (MWR2kMM) algorithm with its corresponding VLSI architecture. With the adoption of MWR2kMM algorithm, the proposed multiplier is able to work with any precision of the input operands and has a shorter critical path. Meanwhile, its performance is much higher compared with previous work because of the optimization of the pipeline architecture. The proposed multiplier is very suitable to the low cost and high performance RSA cryptosystem and can be easily implemented in VLSI technology.

Key words: RSA, Montgomery multiplication, pipeline, scalable, VLSI

中图分类号: 

• TP309.07