Common
General number field sieve
Factorization algorithm
General number field sieve
In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100. Heuristically, its complexity for factoring an integer n {\displaystyle n} (consisting of ⌊ log 2 n ⌋ + 1 {\displaystyle \left\lfloor \log _{2}n\right\rfloor +1} bits) is of the form exp ( ( ( 64 / 9...
Open boosters, collect cards and trade them. Free to play.
Play for free