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

Authors

8

  1. PL
    Peter L. Montgomery

    Microsoft (United States), United States

    2 publications · 1.3K citations

    2

    h-index

  2. HW
    H. W. Lenstra

    University of California, Berkeley, United States

    1 publications · 1K citations

    1

    h-index

  3. JS
    Jeffrey Shallit

    University of Waterloo, Canada

    1 publications · 12 citations

    1

    h-index

  4. DG
    Domingo Gmez

    Universidad Complutense de Madrid, Spain

    1 publications · 27 citations

    1

    h-index

  5. RP
    Richard P. Brent

    Australian National University, Australia

    1 publications · 56 citations

    1

    h-index

1–5 of 8

Institutions

4

Venues

  1. Mathematics of Computation

    MCOM · 3 publications · 1.4K citations

    3

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 56 citations

    1

    h-index

  3. Annals of Mathematics

    1 publications · 1K citations

    1

    h-index

  4. IEEE Transactions on Information Theory

    1 publications · 27 citations

    1

    h-index

1–4