Modular Multiplication Without Trial Division

  • Montgomery P
  • 100

    Readers

    Mendeley users who have this article in their library.
  • 1.4k

    Citations

    Citations of this article.

Abstract

Let $ 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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Peter L. Montgomery

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free