January 8, 2002
Practical Aspects of Modern
Cryptography
Using the Montgomery Product
The Montgomery Product ABR–1 mod M
can be
computed in the time required for two ordinary large-integer
multiplications.
Montgomery transform:
A®AR mod M.
The Montgomery
product of (AR mod M) and (BR mod M) is (ABR
mod M).