It's exponential to a sublinear function (cube root) of log N, not log N. https://en.wikipedia.org/wiki/General_number_field_sieve
> The running time of the number field sieve is super-polynomial but sub-exponential in the size of the input.
It's exponential to a sublinear function (cube root) of log N, not log N. https://en.wikipedia.org/wiki/General_number_field_sieve
> The running time of the number field sieve is super-polynomial but sub-exponential in the size of the input.