Keywords

#general_number_field_sieve

General number field sieve

Factorization algorithm

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 (consisting of ⌊log2 n⌋ + 1 bits) is of the form

Sun 21st

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

General number field sieve Special number field sieve Number field sieve Quadratic sieve Rational sieve Sieve theory Sieve of Eratosthenes Integer factorization RSA numbers Generation of primes
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.