Lenstra elliptic curve factorization (First Category Integer Factoring Integer Factoring)
Jump to navigation
Jump to search
Time Complexity
$O(e^{(\sqrt(({1}+o({1}))n*log n))})$
Space Complexity
$O(n)$? bits
(constant number of values which are expressed in mod N)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1987