An improved Monte Carlo factorization algorithm

  title={An improved Monte Carlo factorization algorithm},
  author={Richard P. Brent},
  journal={BIT Numerical Mathematics},
  • R. Brent
  • Published 1 June 1980
  • Computer Science
  • BIT Numerical Mathematics
Pollard's Monte Carlo factorization algorithm usually finds a factor of a composite integerN inO(N1/4) arithmetic operations. The algorithm is based on a cycle-finding algorithm of Floyd. We describe a cycle-finding algorithm which is about 36 percent faster than Floyd's (on the average), and apply it to give a Monte Carlo factorization algorithm which is similar to Pollard's but about 24 percent faster. 
Some integer factorization algorithms using elliptic curves
  • R. Brent
  • Computer Science, Mathematics
  • 2010
A way in which Lenstra's integer factorization algorithm can be speeded up by the addition of a second phase is suggested, and some refinements which give greater speedup are mentioned.
An Experimental Study of Monte Carlo Factoring Techniques
Different polynomials are tested in the Monte Carlo factoring algorithm to see if a more efficient factoring can be obtained, and the results are inconclusive.
Speeding the Pollard and elliptic curve methods of factorization
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module N and occasionally taking GCDs with N. These began with Pollard's p 1
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
  • F. Kuhn, R. Struik
  • Computer Science, Mathematics
    Selected Areas in Cryptography
  • 2001
This paper extends the analysis of Pollard's rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more than one instance of
A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case
Pollard's Rho is a method for solving the integer factorization problem. The strategy searches for a suitable pair of elements belonging to a sequence of natural numbers that given suitable
Speeding the Pollard and Elliptic Curve Methods
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations modulo N and occasionally taking GCDs with N. These began with Pollard's p 1
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
An empirical performance analysis of several widely applied algorithms is described to provide a better combination of algorithms and a good choice of parameters for Pollard's rho method.
Accelerating Pollard’s Rho Algorithm on Finite Fields
A technique for traveling through the random graph without fully computing each node is developed and an extension to the distinguished point collision detection method that is suitable for this new situation is provided.
Analysis of Pollard's Rho Factoring Method
A comprehensive heuristic analysis of the Pollard's Rho Method (PRM) is given. The analysis is based on ultimate periods and tails distribution of sequences. If $n$ is the composite number to be
Toward A Theory of Pollard's Rho Method
  • E. Bach
  • Mathematics
    Inf. Comput.
  • 1991


A Fast Monte-Carlo Test for Primality
A uniform distribution a from a uniform distribution on the set 1, 2, 3, 4, 5 is a random number and if a and n are relatively prime, compute the residue varepsilon.
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 is
Factorization of the eighth Fermat number
We describe a Monte Carlo factorization algorithm which was used to factorize the Fermat number F8 = 2256+1. Previously, F8 was known to be composite, but its factors were unknown. Comments Only the
Monte Carlo methods for index computation ()
Some novel methods to compute the index of any integer relative to a given primitive root of a prime p, and how a very simple factorization method results, in which a prime factor p of a number can be found in only 0(pW2) operations.
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.
Riemann's Hypothesis and tests for primality
  • G. Miller
  • Computer Science, Mathematics
  • 1975
It is shown that primality is testable in time a polynomial in the length of the binary representation of a number, and a partial solution is given to the relationship between the complexity of computing the prime factorization of a numbers, computing the Euler phi function, and computing other related functions.
A design for a number theory package with an optimized trial division routine
A number theory package is described which uses doubly linked list structures for storing multiprecise integers and an optimally coded trial division routine can be used to determine the unique factorization of large integers.
The complexity of finding periods
This paper presents an algorithm which only requires n(1+O(1/(@@@@)M)) steps, if M memory cells are available to store values of the function, and explicitly considers the performance of the algorithm as a function of the amount of memory available as well as the relative cost of evaluating f and comparing sequence elements for equality.
A monte carlo method for factorization
A novel factorization method involving probabilistic ideas is described briefly, and it is suggested that this method should be considered as a viable alternative to traditional factorization methods.
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.