Montgomery reduction with even modulus
Çetin Kaya Koç · IEE Proceedings - Computers and Digital Techniques · 1994
The modular multiplication and exponentiation algorithms based on the Montgomery reduction technique require that the modulus be an odd integer. It is shown 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.