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

Authors

28

  1. RM
    Ravi Montenegro

    Georgia Institute of Technology, United States

    2 publications · 47 citations

    2

    h-index

  2. PT
    Prasad Tetali

    Georgia Institute of Technology, United States

    2 publications · 47 citations

    2

    h-index

  3. JH
    Jeong Han Kim

    Microsoft (United States), United States

    2 publications · 47 citations

    2

    h-index

  4. SB
    Shi Bai

    Institut national de recherche en sciences et technologies du numérique, France

    1 publications · 15 citations

    1

    h-index

  5. BA
    Babasaheb Ambedkar

    M.J.P. Rohilkhand University, India

    1 publications · 17 citations

    1

    h-index

1–5 of 28

Venues

  1. Mathematics of Computation

    MCOM · 2 publications · 962 citations

    2

    h-index

  2. The Annals of Applied Probability

    1 publications · 31 citations

    1

    h-index

  3. International Mathematics Research Notices

    IMRN · 1 publications · 18 citations

    1

    h-index

  4. The Open Book Series

    1 publications · 19 citations

    1

    h-index

  5. ANU Open Research (Australian National University)

    Repository · 1 publications · 15 citations

    1

    h-index

1–5