Monte Carlo methods for index computation ()

  title={Monte Carlo methods for index computation ()},
  author={John M. Pollard},
  journal={Mathematics of Computation},
  • J. Pollard
  • Published 1 September 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… Expand
A generic approach to searching for Jacobians
By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, this work can search for Jacobians containing a large subgroup of prime order. Expand
Subset-Restricted Random Walks for Pollard rho Method on Fpm
This paper uses an iterating function whose image size is much smaller than its domain and hence reaches a collision faster than the original Iterating function, and shows time complexity advantage over the original Pollard rho method on multiplicative subgroups of Fpm. Expand
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
An algorithm is given to solve the DLP in an interval of size N with heuristic average case expected running time of close to $1.36\sqrt{N}$ group operations for groups with fast inversion. Expand
On improvements of the r-adding walk in a finite field of characteristic 2
This paper studies the modified r-adding walk, which claims to reduce the amount of work done in one iteration of the original r- adding walk, and critically analyzes it and compares it with the original R-addingWalk. Expand
Speeding Up Pollard's Rho Method for Computing Discrete Logarithms
New iterating functions for computing discrete logarithms with the rho method are defined and compared and it is shown that one of these functions is expected to reduce the number of steps by a factor of approximately 0.8, in comparison with Pollard's originally used function. Expand
Computing discrete logarithms in an interval
Two new low-storage algorithms for the discrete logarithm problem in an interval of size N, based on the Pollard kangaroo method and the Gaudry-Schost algorithm, are presented and experimental results show that the methods do work close to that predicted by the theoretical analysis. Expand
A Deterministic Algorithm for Computing Divisors in an Interval
We revisit the problem of finding a nontrivial divisor of a composite integer when it has a divisor in an interval \([\alpha , \beta ]\). We use Strassen’s algorithm to solve this problem. ComparedExpand
Speeding Up the Pollard Rho Method on Prime Fields
A method to speed up the r -adding walk on multiplicative subgroups of the prime field with significantly reduced execution time for each iteration using a pre-computed table of size O ((logp ) r + 1·loglogp ). Expand
Algorithms for discrete logarithm in finite fields
In this thesis we study at length the discrete logarithm problem in finite fields. In the first part, we focus on the notion of smoothness and on ECM, the fastest known smoothness test. We present anExpand
Algorithms in Number Theory
  • A. K. Lenstra, H. Lenstra
  • Computer Science, Mathematics
  • Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990
This chapter discusses algorithms that solve two basic problems in computational number theory—factoring integers into prime factors and finding discrete logarithms. Expand


On factorisation, with a suggested new approach
This paper gives a brief survey of methods based mainly on Fermat's Theorem, for testing and establishing primality of large integers. It gives an extension of the Fermat-Lucas-Lehmer Theorems whichExpand
A New Factorization Technique Using Quadratic Forms
The paper presents a practical method for factoring an arbitrary N by represent- ing N or XN by one of at most three quadratic forms: XN = x- - Dy2, X = 1,-1, 2, D = -1, ?2, ?3, ?6. These three formsExpand
Theorems on factorization and primality testing
This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n or test it for primality, and uses a multi-tape Turing machine for this purpose. Expand
A method of factoring and the factorization of
The continued fraction method for factoring integers, which was introduced by D. H. Lehmer and R. E. Powers, is discussed along with its computer implementation. The power of the method isExpand
Cycle distributions in random nets.
  • A. Rapoport
  • Mathematics, Medicine
  • The Bulletin of mathematical biophysics
  • 1948
Characteristics of random nets are derived from assumptions concerning the distribution of connections and it is shown that in the single aggregate with random connections, the cycle saturation varies inversely as the square root of the number of neurons; in the dense two-chain net it varies in proportional proportion to the neuron density. Expand
Steady states in random nets.
A neural net is taken to consist of a semi-infinite chain of neurons with connections distributed according to a certain probability frequency of the lengths of the axones, and the statistical properties of the net determine a certain steady state output. Expand
The Art of Computer Programming
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid. Expand
Sorting and Searching
The first revision of this third volume is a survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large andExpand
New directions in cryptography
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing. Expand
A monte carlo method for factorization
We describe briefly a novel factorization method involving probabilistic ideas.