Pollard's rho algorithm (First Category Integer Factoring Integer Factoring)

From Algorithm Wiki
Revision as of 08:55, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

-

Space Complexity

$O(n)$ bits

(keep track of g (the polynomial; O(1) space), x, y, and d (all O(n) space))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1975

Reference

https://link.springer.com/article/10.1007%2FBF01933667