对提高RSA算法中大数模乘运算速率的思考  

Thoughts on improving rate of large number modular multiplication in RSA algorithm

作　　者：贾斌斌 王忠庆 方炜 JIA Binbin;WANG Zhongqing;FANG Wei(School of Electrical and Control Engineering,North University of China,Taiyuan 030051,China)

机构地区：[1]中北大学电气与控制工程学院,太原030051

出　　处：《信息通信技术与政策》2023年第6期84-90,共7页Information and Communications Technology and Policy

基　　金：山西省科技重大专项计划“揭榜挂帅”项目(No.202101010101017);山西省重点研发计划项目(No.201903D111003)。

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

关 键 词：RSA算法 基2-Montgomery MONTGOMERY算法 Kogge-stone加法器 

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