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

From Algorithm Wiki
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