Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

New Frameworks for Montgomery's Modular Multiplication Method

Philip B. McLaughlin, Jr.
Mathematics of Computation
Vol. 73, No. 246 (Apr., 2004), pp. 899-906
Stable URL: http://www.jstor.org/stable/4099809
Page Count: 8
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
New Frameworks for Montgomery's Modular Multiplication Method
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
899
    899
  • Thumbnail: Page 
900
    900
  • Thumbnail: Page 
901
    901
  • Thumbnail: Page 
902
    902
  • Thumbnail: Page 
903
    903
  • Thumbnail: Page 
904
    904
  • Thumbnail: Page 
905
    905
  • Thumbnail: Page 
906
    906