Shanks's square forms factorization (SQUFOF) (Second 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({2}^{n/4})$

Space Complexity

$O(n)$? bits

(Constant number of O(n)-bit integers)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

2007

Reference

https://www.ams.org/journals/mcom/2008-77-261/S0025-5718-07-02010-8/S0025-5718-07-02010-8.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Shanks%27s_square_forms_factorization_(SQUFOF)_(Second_Category_Integer_Factoring_Integer_Factoring)&oldid=46992"