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
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
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
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
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
{\displaystyle p} is large compared to q {\displaystyle q} , the function field sieve, L q [ 1 / 3 , 32 / 9 3 ] {\textstyle L_{q}\left[1/3,{\sqrt[{3}]{32/9}}\...
11 KB (1,720 words) - 04:38, 15 January 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) - 23:13, 8 August 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
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
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...
14 KB (1,995 words) - 09:15, 23 May 2024
Discrete logarithm (category Finite fields)
the size of the group). Baby-step giant-step Function field sieve Index calculus algorithm Number field sieve Pohlig–Hellman algorithm Pollard's rho algorithm...
17 KB (2,043 words) - 22:45, 29 July 2024
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
In mathematics, the sieve of Sundaram is a variant of the sieve of Eratosthenes, a simple deterministic algorithm for finding all the prime numbers up...
9 KB (1,368 words) - 04:26, 17 June 2024
Fermat's factorization method are the basis of the quadratic sieve and general number field sieve, the best-known algorithms for factoring large semiprimes...
10 KB (1,443 words) - 10:57, 30 June 2024
Modular exponentiation (redirect from Discrete exponential function)
exponent e when given b, c, and m – is believed to be difficult. This one-way function behavior makes modular exponentiation a candidate for use in cryptographic...
21 KB (2,802 words) - 00:03, 24 March 2024
completed with a highly optimized implementation of the general number field sieve run on hundreds of machines. No algorithm has been published that can...
25 KB (2,981 words) - 18:28, 21 June 2024
the rational sieve is a general algorithm for factoring integers into prime factors. It is a special case of the general number field sieve. While it is...
6 KB (915 words) - 09:57, 4 July 2024
such cases other methods are used such as the quadratic sieve and the general number field sieve (GNFS). Because these methods also have superpolynomial...
8 KB (1,151 words) - 05:51, 16 June 2024
Observations analogous to the preceding can be applied recursively, giving the Sieve of Eratosthenes. One way to speed up these methods (and all the others mentioned...
26 KB (3,806 words) - 14:19, 25 July 2024
suffices to replace everywhere 10 by 2. The second argument of the split_at function specifies the number of digits to extract from the right: for example,...
13 KB (2,044 words) - 21:24, 21 July 2024
AKS primality test (category Finite fields)
{\tilde {O}}(\log(n)^{10.5})} , later reduced using additional results from sieve theory to O ~ ( log ( n ) 7.5 ) {\displaystyle {\tilde {O}}(\log(n)^{7...
20 KB (2,448 words) - 20:19, 19 March 2024
Mathematica as the function LatticeReduce Number Theory Library (NTL) as the function LLL PARI/GP as the function qflll Pymatgen as the function analysis...
15 KB (2,128 words) - 15:42, 2 April 2024
giant-step Pollard rho Pollard kangaroo Pohlig–Hellman Index calculus Function field sieve Greatest common divisor Binary Euclidean Extended Euclidean Lehmer's...
7 KB (1,061 words) - 00:47, 2 June 2024
0) = rN−1. function gcd(a, b) if b = 0 return a else return gcd(b, a mod b) (As above, if negative inputs are allowed, or if the mod function may return...
123 KB (15,119 words) - 08:05, 21 August 2024
most efficient known classical factoring algorithm, the general number field sieve, which works in sub-exponential time: O ( e 1.9 ( log N ) 1 / 3 ( log...
41 KB (5,886 words) - 09:59, 12 August 2024
compute the multiplicative inverse in algebraic field extensions and, in particular in finite fields of non prime order. It follows that both extended...
28 KB (4,452 words) - 21:55, 14 August 2024
Greatest common divisor (category Multiplicative functions)
= gcd(a, b)/m. The GCD is a commutative function: gcd(a, b) = gcd(b, a). The GCD is an associative function: gcd(a, gcd(b, c)) = gcd(gcd(a, b), c). Thus...
35 KB (4,710 words) - 01:08, 5 August 2024
LispWorks Ltd (1996). "CLHS: Function SQRT, ISQRT". www.lispworks.com. Python Software Foundation (2001). "Mathematical functions". Python Standard Library...
16 KB (2,410 words) - 03:37, 13 December 2023
Lenstra elliptic-curve factorization (category Finite fields)
second-fastest is the multiple polynomial quadratic sieve, and the fastest is the general number field sieve. The Lenstra elliptic-curve factorization is named...
26 KB (4,508 words) - 23:04, 16 April 2024