Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Pollard's rho algorithm

Known as: Pollard-rho, Rho (disambiguation), Pollard's rho method 
Pollard's rho algorithm is a special-purpose integer factorization algorithm. It was invented by John Pollard in 1975. It is particularly effective… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Frequent fire is a feature of the mesic Australian savannas, yet little is known about its effect on tree growth rates. Growth… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
We show that the classical Pollard ρ algorithm for discrete logarithms produces a collision in expected time $O(\sqrt{n}(\log n… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Two of the most important sources of catastrophic risk are terrorism and climate change. The United States has responded… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
For the numerical inversion of Laplace transforms we suggest to use multi-precision computing with the level of precision… Expand
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
2004
2004
  • E. Teske
  • Journal of Cryptology
  • 2004
  • Corpus ID: 26348937
Abstract We propose an elliptic curve trapdoor system which is of interest in key escrow applications. In this system, a pair… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The proper function of Rho GTPases requires precise spatial and temporal regulation of effector interactions. Integrin-mediated… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • E. Teske
  • Math. Comput.
  • 2001
  • Corpus ID: 5610482
We consider Pollard's rho method for discrete logarithm computation. Usually, in the analysis of its running time the assumption… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In Pollard's rho method, an iterating function f is used to define a sequence (y i) by y i+1=f(y i) for i=0,1, 2,..., with some… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Current techniques for collision search with feasible memory requirements involve pseudo-random walks through some space where… Expand
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful… Expand
Is this relevant?