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 need an accessible version of this item please contact JSTOR User Support

Asymptotically Fast Factorization of Integers

John D. Dixon
Mathematics of Computation
Vol. 36, No. 153 (Jan., 1981), pp. 255-260
DOI: 10.2307/2007743
Stable URL: http://www.jstor.org/stable/2007743
Page Count: 6
  • Get Access
  • Read Online (Free)
  • Download ($34.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Asymptotically Fast Factorization of Integers
Preview not available

Abstract

The paper describes a "probabilistic algorithm" for finding a factor of any large composite integer $n$ (the required input is the integer $n$ together with an auxiliary sequence of random numbers). It is proved that the expected number of operations which will be required is $O(\exp\{\beta(\ln n \ln \ln n)^{1/2}\})$ for some constant $\beta > 0$. Asymptotically, this algorithm is much faster than any previously analyzed algorithm for factoring integers; earlier algorithms have all required $O(n^\alpha)$ operations where $\alpha > 1/5$.

Page Thumbnails

  • Thumbnail: Page 
255
    255
  • Thumbnail: Page 
256
    256
  • Thumbnail: Page 
257
    257
  • Thumbnail: Page 
258
    258
  • Thumbnail: Page 
259
    259
  • Thumbnail: Page 
260
    260