Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

Modular multiplication without trial division


Author: Peter L. Montgomery
Journal: Math. Comp. 44 (1985), 519-521
MSC: Primary 11Y16
MathSciNet review: 777282
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y16

Retrieve articles in all journals with MSC: 11Y16


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1985-0777282-X
PII: S 0025-5718(1985)0777282-X
Keywords: Modular arithmetic, multiplication
Article copyright: © Copyright 1985 American Mathematical Society