Pollard's p − 1 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

$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

Reference

https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/theorems-on-factorization-and-primality-testing/6762E84DBD34AEF13E6B1D1A8334A989

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Pollard%27s_p_−_1_algorithm_(First_Category_Integer_Factoring_Integer_Factoring)&oldid=46987"