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.

Monte Carlo Methods for Index Computation $(\operatorname{mod} p)$

J. M. Pollard
Mathematics of Computation
Vol. 32, No. 143 (Jul., 1978), pp. 918-924
DOI: 10.2307/2006496
Stable URL: http://www.jstor.org/stable/2006496
Page Count: 7
  • 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.
Preview not available

Abstract

We describe some novel methods to compute the index of any integer relative to a given primitive root of a prime $p$. Our first method avoids the use of stored tables and apparently requires $O(p^{1/2})$ operations. Our second algorithm, which may be regarded as a method of catching kangaroos, is applicable when the index is known to lie in a certain interval; it requires $O(w^{1/2})$ operations for an interval of width $w$, but does not have complete certainty of success. It has several possible areas of application, including the factorization of integers.

Page Thumbnails

  • Thumbnail: Page 
918
    918
  • Thumbnail: Page 
919
    919
  • Thumbnail: Page 
920
    920
  • Thumbnail: Page 
921
    921
  • Thumbnail: Page 
922
    922
  • Thumbnail: Page 
923
    923
  • Thumbnail: Page 
924
    924