General number field sieve - Wikipedia
In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10 100. Heuristically, its complexity for factoring an integer n (consisting of ⌊log 2 n ⌋ + 1 bits) is of the form ((+ ()) () ( )) = [,] (in L-notation), where ln is the natural logarithm. It is a generalization of the special number field ...
اقرأ أكثر