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...
13 KB (2,658 words) - 21:36, 7 April 2024
In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100. Heuristically...
13 KB (1,768 words) - 03:41, 21 July 2024
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...
24 KB (3,042 words) - 00:45, 15 August 2024
quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known (after the general number field sieve)....
27 KB (4,487 words) - 16:24, 29 June 2024
mathematics, the special number field sieve (SNFS) is a special-purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from...
9 KB (1,427 words) - 20:31, 10 March 2024
List of number theory topics (section Sieve methods)
theorem Brun sieve Function field sieve General number field sieve Large sieve Larger sieve Quadratic sieve Selberg sieve Sieve of Atkin Sieve of Eratosthenes...
10 KB (935 words) - 18:31, 29 August 2024
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...
14 KB (2,359 words) - 17:04, 3 August 2024
Generation of primes (redirect from Prime sieve)
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...
8 KB (1,154 words) - 14:51, 4 February 2024
Function field may refer to: Function field of an algebraic variety Function field (scheme theory) Algebraic function field Function field sieve Function...
231 bytes (56 words) - 13:23, 28 December 2019
Discrete logarithm records (section Finite fields)
variant of the medium-sized base field function field sieve, for binary fields, to compute a discrete logarithm in a field of 21971 elements. In order to...
32 KB (3,409 words) - 03:27, 31 July 2024