General number field sieve

• abstract: In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of \left\lfloor \log_2 n\right\rfloor + 1 bits) is of the form

以上来源于: WordNet