Evidence Hub

Modular multiplication without trial division

Peter L. Montgomery

Mathematics of Computation, 1985

2,388 citations

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.

Read the paper

Related studies

Go deeper in Evidence Hub

Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.

Open this study Sign up free