摘要
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.
出处
《计算机应用与软件》
CSCD
北大核心
2006年第6期109-111,共3页
Computer Applications and Software
关键词
加密
蒙哥马利
模乘
RSA
Encryption Montgomery Modular multiplication RSA
