mathematics the Function Field Sieve is one of the most efficient algorithms to solve the Discrete Logarithm Problem (DLP) in a finite field. It has heuristic...

In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100. Heuristically...

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking...

quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known (after the general number field sieve)....

mathematics, the special number field sieve (SNFS) is a special-purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from...

theorem Brun sieve Function field sieve General number field sieve Large sieve Larger sieve Quadratic sieve Selberg sieve Sieve of Atkin Sieve of Eratosthenes...

Function field may refer to: Function field of an algebraic variety Function field (scheme theory) Algebraic function field Function field sieve Function...

mathematics, the sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes...

sophisticated sieves also do not work directly with sets per se, but instead count them according to carefully chosen weight functions on these sets (options...

prime. A prime sieve or prime number sieve is a fast type of algorithm for finding primes. There are many prime sieves. The simple sieve of Eratosthenes...