Pollard's Rho Algorithm
Pollard's Rho Algorithm is a probabilistic integer factorization algorithm that employs a cycle-detection method based on Floyd's algorithm to efficiently find non-trivial factors of a composite number.
15
Publications
1.3K
Citations
31
Authors
18
Institutions
Publications per year
2017–2026
2
Parents
15
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 15
31
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 31
18
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
Seoul National University
Seoul, South Korea
1 h-index
3 publications
39 citations
Virginia Tech
Blacksburg, United States
1 h-index
3 publications
48 citations

Beijing University of Posts and Telecommunications
Beijing, China
1 h-index
3 publications
90 citations
Universitas Muhammadiyah Jember
Jember, Indonesia
1 h-index
1 publications
14 citations
Yonsei University
Seoul, South Korea
1 h-index
1 publications
16 citations
1–8 of 18
MCOM · 2 publications · 962 citations
2
h-index
1 publications · 48 citations
1
h-index
1 publications · 30 citations
1
h-index
IMRN · 1 publications · 18 citations
1
h-index
1 publications · 19 citations
1
h-index
1–5