Title :
Montgomery reduction with even modulus
Author_Institution :
Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
fDate :
9/1/1994 12:00:00 AM
Abstract :
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
Keywords :
cryptography; Chinese remainder theorem; Montgomery reduction; Montgomery reduction technique; even modulus; exponentiation algorithms; modular arithmetic operations; modular multiplication;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
DOI :
10.1049/ip-cdt:19941291
