Peter L. Montgomery
Abstract
Let N > 1 N > 1 . We present a method for multiplying two integers (called N-residues ) modulo N while avoiding division by N . N -residues are represented in a nonstandard way, so this method is useful only if several computations are done modulo one N . The addition and subtraction algorithms are unchanged.
OpenAlex reports 2386 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.
Let N > 1 N > 1 . We present a method for multiplying two integers (called N-residues ) modulo N while avoiding division by N . N -residues are represented in a nonstandard way, so this method is useful only if several computations are done modulo one N . The addition and subtraction algorithms are unchanged.
Key concepts: Mathematics, Modulo, Algorithm, Arithmetic, Combinatorics