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.
CITATION STYLE
Montgomery, P. L. (1985). Modular multiplication without trial division. Mathematics of Computation, 44(170), 519–521. https://doi.org/10.1090/s0025-5718-1985-0777282-x
Mendeley helps you to discover research relevant for your work.