Philip B. McLaughlin
Abstract
Open-access reader
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.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Modular arithmetic, Modular design, Mathematics, Multiplication (music), Arithmetic, Polynomial, Algebra over a field, Algorithm