Monte Carlo methods for index computation ()

@article{Pollard1978MonteCM,
  title={Monte Carlo methods for index computation ()},
  author={J. M. Pollard},
  journal={Mathematics of Computation},
  year={1978},
  volume={32},
  pages={918-924}
}
  • J. M. Pollard
  • Published 1978
  • Mathematics
  • Mathematics of Computation
  • We describe some novel methods to compute the index of any integer relative to a given primitive root of a prime p. Our flrst 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/2) operations for an interval of width w, but does not have complete certainty of success. It has several possible areas of… CONTINUE READING
    Lower Bounds for Discrete Logarithms and Related Problems
    • 1,084
    • PDF
    Use of Elliptic Curves in Cryptography
    • 3,275
    • PDF
    Efficient signature generation by smart cards
    • 2,114
    • PDF
    Algorithms in Number Theory
    • 188
    The arithmetic of elliptic curves
    • 3,497
    • PDF
    Guide to Elliptic Curve Cryptography
    • 2,578
    • PDF
    Discrete Logarithms in Finite Fields and Their Cryptographic Significance
    • 370
    • Highly Influenced
    • PDF
    Parallel Collision Search with Cryptanalytic Applications
    • 328
    • Highly Influenced
    • PDF
    Speeding Up Pollard's Rho Method for Computing Discrete Logarithms
    • E. Teske
    • Computer Science, Mathematics
    • 1998
    • 144
    • Highly Influenced
    The Elliptic Curve Digital Signature Algorithm (ECDSA)
    • 1,478
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES
    The Art of Computer Programming
    • 11,830
    New directions in cryptography
    • 13,251
    • PDF
    Theorems on factorization and primality testing
    • 357
    M
    • 261,161
    • PDF
    Sorting and Searching
    • 1,568
    On factorisation, with a suggested new approach
    • 15
    • PDF
    Cycle distributions in random nets.
    • 38
    A monte carlo method for factorization
    • 372