Montgomery算法的改进及其在RSA中的运用  

THE IMPROVEMENT OF MONTGOMERY ALGORITHM AND ITS APPLICATION IN RSA

作　　者：陈逢林[1] 苏厚勤[2] 

机构地区：[1]安庆师范学院数学系,安徽安庆246003 [2]东华大学计算机科学与技术学院,上海200051

出　　处：《计算机应用与软件》2006年第6期109-111,共3页Computer Applications and Software

摘　　要：Montgom ery算法被认为是计算大数模乘的最快的算法。详细叙述了它的理论基础和算法原理,加以改进并应用在RSA模幂运算中。The Montgomery algorithm is considered to be the fastest algorithm to compute large number modular multiplication. The theoretic foundation and principle of the algorithm have been described in details, and its application has also been reformed in the RSA modular exponentiation.

关 键 词：加密 蒙哥马利 模乘 RSA 

分 类 号：TP309[自动化与计算机技术—计算机系统结构] TP391.41[自动化与计算机技术—计算机科学与技术]