New frameworks for Montgomery’s modular multiplication method
Philip B. McLaughlin · Mathematics of Computation · 2003
We present frameworks for fast modular multiplication based on a modification of Montgomery’s original method. For (fixed) large integers, our algorithms may be significantly faster than conventional methods. Our techniques may also be extended to modular polynomial arithmetic.