A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation

A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common part in two modular multiplications can be computed once rather than twice. It reduces the overall number of single-precision multiplications by about 16%, compared to exponentiation with the Montgomery algorithm. Key words: Public key cryptosystem Fast exponentiation Modular arithmetic Common-multiplicand multiplication

• Type: Journal
• Year: 1998
• Where: IPL
• Authors: JaeCheol Ha, Sang-Jae Moon
• Keywords: Cryptosystem Fast Exponentiation, IPL 1998, Montgomery Algorithm, Right-to-left Binary Exponentiation