Montgomery Reduction with Even ModulusC. K. KocIEE Proceedings - Computers and Digital Techniques, 141(5)314-316, September 1994.AbstractThe modular multiplication and exponentiation algorithms based on the Montgomery reduction technique require that the modulus be an odd integer. In this short paper, we show that, with the help of the Chinese Remainder Theorem, the Montgomery reduction algorithm can be used to efficiently perform these modular arithmetic operations with respect to an even modulus. |