Pollard Rho Algorithm
The Pollard Rho Algorithm is a probabilistic factorization algorithm that uses cycle detection in pseudorandom sequences to efficiently find non-trivial divisors of a composite integer.
14
Publications
1.3K
Citations
28
Authors
17
Institutions
Publications per year
2017–2026
1
Variants
Pollard's Rho Algorithm
Parents
14
On random walks for Pollard’s rho method
Edlyn Teske · Mathematics of Computation · 2000 · 116 citations · Full text
Toward a theory of Pollard's rho method
Eric Bach · Information and Computation · 1991 · 48 citations
1–5 of 14
28
2
h-index
2
h-index
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
1 publications · 15 citations
1
h-index
1
h-index
1–5 of 28
17
University of Massachusetts Lowell
Lowell, United States
2 h-index
5 publications
140 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
5 publications
140 citations
National Institute for Mathematical Sciences
Daejeon, South Korea
2 h-index
7 publications
163 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
1 h-index
1 publications
19 citations
Universitas Muhammadiyah Malang
Malang, Indonesia
1 h-index
2 publications
28 citations
Microsoft (United States)
Redmond, United States
1 h-index
4 publications
124 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
116 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
2 publications
36 citations
1–8 of 17
MCOM · 2 publications · 962 citations
2
h-index
1 publications · 31 citations
1
h-index
IMRN · 1 publications · 18 citations
1
h-index
1 publications · 19 citations
1
h-index
Repository · 1 publications · 15 citations
1
h-index
1–5