Modular multiplication method
Jong-Soo Oh, SangJae Moon · IEE Proceedings - Computers and Digital Techniques · 1998
The Montgomery algorithm has been widely used in modern cryptography because it is effective for modular exponentiation. However, it is not efficient when used for just a few modular multiplications. Inefficiency is due to the large overhead involved in the residue transformation of arguments. A new modular multiplication method using the Montgomery reduction algorithm is presented which can eliminate the demerit of the Montgomery algorithm in the case of just a few modular multiplications.