|
One item is filed under this topic.
 |
|
|
|
|
|
|
|
|
Factoring integers |
2004-07-02 |
|
From A student:
After looking at all the info I could get about NFS, I still have some questions that are unsolved:
First of all: If someone found an algorithm that has a worst case running time of N*Log(N) to factor an integer n into his divisors, would it be quicker or slower then the number field sieve algorithm?
secondly, what exactly is the time complexity of the Number Field Sieve algorithm, if I would factor an integer n?
Answered by Claude Tardif. |
|
|
|
