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)

 

New frameworks for Montgomery's modular multiplication method


Author: Philip B. McLaughlin Jr.
Journal: Math. Comp. 73 (2004), 899-906
MSC (2000): Primary 11-04, 11Y16; Secondary 11A07, 11T55
Published electronically: May 7, 2003
MathSciNet review: 2031414
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We present frameworks for fast modular multiplication based on a modification of Montgomery's original method. For (fixed) large integers, our algorithms may be significantly faster than conventional methods. Our techniques may also be extended to modular polynomial arithmetic.


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


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11-04, 11Y16, 11A07, 11T55

Retrieve articles in all journals with MSC (2000): 11-04, 11Y16, 11A07, 11T55


Additional Information

Philip B. McLaughlin Jr.
Affiliation: 237 N. Harris Avenue, Tucson, Arizona 85716
Email: pbmcl@netscape.net

DOI: http://dx.doi.org/10.1090/S0025-5718-03-01543-6
PII: S 0025-5718(03)01543-6
Keywords: Modular arithmetic, multiplication, factorization, primality testing, polynomial arithmetic, public-key cryptography
Received by editor(s): May 5, 2000
Received by editor(s) in revised form: July 2, 2002
Published electronically: May 7, 2003
Article copyright: © Copyright 2003 American Mathematical Society