MONTGOMERY REDUCTION, WITH EVEN MODULUS

Authors
KOC CK
Citation
Ck. Koc, MONTGOMERY REDUCTION, WITH EVEN MODULUS, IEE proceedings. Computers and digital techniques, 141(5), 1994, pp. 314-316
Citations number
11
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
IEE proceedings. Computers and digital techniques → ACNP
ISSN journal
13502387
Volume
141
Issue
5
Year of publication
1994
Pages
314 - 316
Database
ISI
SICI code
1350-2387(1994)141:5<314:MRWEM>2.0.ZU;2-9
Abstract
The modular multiplication and exponentiation algorithms based on the Montgomery reduction technique require that the modulus be an odd inte ger. 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.