Pollard P-1 Algorithm
The Pollard P-1 Algorithm is a deterministic integer factorization algorithm that exploits the smoothness properties of the prime factor minus one to efficiently discover non-trivial factors of composite numbers.
7
Publications
2.4K
Citations
8
Authors
4
Institutions
Publications per year
2017–2026
0
Variants
Pollard's P-1 Algorithm
Parents
7
1–5 of 7
8
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 8
4
Institute of Mathematics
Warsaw, Poland
1 h-index
1 publications
19 citations

Polish Academy of Sciences
Warsaw, Poland
1 h-index
1 publications
19 citations

Australian National University
Canberra, Australia
1 h-index
1 publications
56 citations

Universidad de Cantabria
Santander, Spain
1 h-index
3 publications
81 citations
1–4 of 4
MCOM · 3 publications · 1.4K citations
3
h-index
Repository · 1 publications · 56 citations
1
h-index
1 publications · 1K citations
1
h-index
1 publications · 27 citations
1
h-index
1–4