一种新型的基于Montgomery的模幂器结构  

Novel Architecture for Modular Exponentiator Based on Montgomery

作　　者：张远洋[1] 李峥[1] 杨磊[1] 张少武[1] 

机构地区：[1]解放军信息工程大学电子技术学院,郑州450004

出　　处：《计算机工程》2007年第16期211-213,共3页Computer Engineering

摘　　要：大数模乘是许多公钥密码体制的核心运算,也是运算效率提高的瓶颈。基于Montgomery模乘算法,该文提出了一种改进的快速模乘及其模幂算法,由于采用了新的booth编码,算法的循环次数减少近一半,因此性能提高近一倍。模幂器采用新型的保留进位加法器(CSA)树,此结构无须对每次模乘的结果求和。实验表明,在97MHz时钟频率下,1 024-bit模幂器的波特率为184Kb/s,适合于设计高速的公钥密码协处理器。Modular multiplication of large integers is the kernel operation in many public-key crypto-systems. It is also the bottleneck of the computing efficiency. Based on Montgomery multiplication algorithm, this paper presents an improved multiplication algorithm and its exponentiation algorithm, which is twice faster than the conventional version, with about 50% reduction in iterations by using modified booth encoding, A novel architecture using carry save adders （CSA） tree is applied to the modular exponentiator, without computing full addition of the output of each modular multiplication. The result shows that the modular exponentiator is about 184Kb/s for 1 024-bit operands at a clock of 97MHz and well suitable for designing the high-speed public-key coprocessor.

关 键 词：Montgomery模乘算法 保留进位加法器 RSA 

分 类 号：TN47[电子电信—微电子学与固体电子学]