General number field sieve (Second Category Integer Factoring Integer Factoring)
Jump to navigation
Jump to search
Time Complexity
$O(exp(({1}+o({1})$)({64}n/{9})^{({1}/{3})}(log n)^{({2}/{3})}) heuristically?
Space Complexity
$O(n^{2/3})$ bits
(http://www.ams.org/notices/199612/pomerance.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1996