Montgomery算法被认为是计算大数模乘的最快的算法。本文详细叙述了它的理论基础和算法原理,加以改进并应用在RSA

模幂运算中。-Montgomery algorithm is considered the model of large numbers by calculating the fastest algorithm. This paper describes its theoretical basis and algorithm theory, be improved and applied to modular exponentiation in RSA.