【摘要】 RSA算法的核心是大数模乘运算，提高其运算速率不仅对改进RSA算法本身有着重要的意义，而且，如果能够通过专用集成电路快速而低成本的实现，将会对电子商务的推广产生积极作用。在研究蒙哥马利算法的基础上，提出一种基于并行前缀加法器架构的基2-Montgomery模乘运算，构建了1 024 bit的Kogge-stone加法器。仿真结果表明，该方法可以有效减少模乘运算中操作数的延迟时间，在一定程度上提高大数模乘的运算效率。更多还原

【Abstract】 The core of RSA algorithm is large number modular multiplication. Improving its operation speed is not only of great significance to the improvement of RSA algorithm, but also will have a certain positive effect on the promotion of e-commerce if the speed can be achieved quickly and cheaply through application specific integrated circuit. Based on the study of Montgomery algorithm, this paper proposes a basic 2-Montgomery modular multiplication operation based on the parallel prefix adder architecture, and constructs a 1 024-bit Kogge-stone adder. The simulation results show that the proposed method can effectively reduce the delay time of operand and improve the efficiency of large number modular multiplication to a certain extent.更多还原