Pollard's p − 1 algorithm (First Category Integer Factoring Integer Factoring)
Jump to navigation
Jump to search
Time Complexity
$O(B*log B*log^{2}(n)$)?
Space Complexity
$O(n+B)$ bits
(the number M requires O((log B)*pi(B)) = O(B) bits, and the other numbers require O(n) bits)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1974