蒙哥马利算法在RSA公钥算法中的应用  

Montgomerie algorithm in the application of RSA public key algorithm

作　　者：徐江涛[1] 傅妍芳[1] 

机构地区：[1]西安工业大学计算机学院,陕西西安710032

出　　处：《电子设计工程》2013年第9期120-121,124,共3页Electronic Design Engineering

基　　金：陕西省科技厅攻关项目(2011K06-14)

摘　　要：RSA算法是第一个能同时用于加密和数字签名的算法,是一个被研究的最广的算法,从提出到现在经历了各种攻击的考验,逐渐为人们接受,普遍认为是目前最优秀的公钥算法之一。但是幂模运算是RSA的速度瓶颈,而模幂运算又可以转化为平均(3e)/2次的模乘运算,蒙哥马利算法被认为是计算大数模乘的最快算法,利用蒙哥马利算法对幂模运算的改进可以大大提高RSA的加解密效率。实验证明,使用1 024位密钥加密文件,利用蒙哥马利算法改进后的RSA算法的加密耗时减少了3/4左右。RSA algorithm is the first one can be used for encryption and digital signature algorithm, is a study of the most popular algorithm, from put forward now has experienced each kind of attack test, gradually accepted, generally considered to be the most outstanding public key algorithm. But the modular multiplication is the speed bottleneck of RSA, while the modular exponentiation can be converted into average （ 3e ）/2 times of modular multiplication algorithm, Montgomerie is considered the calculation of large numbers of modular multiplication is the fastest algorithm, the use of Montgomerie algorithm for the computation power module improvement can greatly improve RSA encryption efficiency. Experiments show that, using the 1024 encryption key, the use of Montgomerie algorithm improved RSA algorithm encryption time consuming reduced about 3/4.

关 键 词：公钥算法 RSA 蒙哥马利算法 加 解密 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]