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...

Atkin Sieve of Sundaram Sieve theory Horsley, Rev. Samuel, F. R. S., "Κόσκινον Ερατοσθένους or, The Sieve of Eratosthenes. Being an account of his method...

the sieve of Sundaram (1934), the still faster but more complicated sieve of Atkin (2003), sieve of Pritchard (1979), and various wheel sieves are most...

range. Sieve of Eratosthenes Legendre sieve Sieve of Sundaram Sieve theory A.O.L. Atkin, D.J. Bernstein, Prime sieves using binary quadratic forms, Math...

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

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

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

mathematics, the sieve of Pritchard is an algorithm for finding all prime numbers up to a specified bound. Like the ancient sieve of Eratosthenes, it...

onto the sieve (i.e., increasing the number of equations while reducing the number of variables). The third stage searches for a power s of the generator...

by p and see whether the congruence holds. If it does not hold for a value of a, then p is composite. This congruence is unlikely to hold for a random a...

In 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...

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

the halfway point. Sieve of Sundaram Sieve of Atkin Sieve of Pritchard Sieve theory Pritchard, Paul, "Linear prime-number sieves: a family tree," Sci...

The Trachtenberg system is a system of rapid mental calculation. The system consists of a number of readily memorized operations that allow one to perform...

quadratic sieve and the general number field sieve (GNFS). Because these methods also have superpolynomial time growth a practical limit of n digits is...

greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers...

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...

However, none of them runs in polynomial time (in the number of digits in the size of the group). Baby-step giant-step Function field sieve Index calculus...

sets of numbers General number field sieve Large sieve Quadratic sieve Sieve of Atkin Sieve of Eratosthenes Sieve of Sundaram Sieve of Pritchard Sieve, in...

time. The fundamental ideas of Fermat's factorization method are the basis of the quadratic sieve and general number field sieve, the best-known algorithms...

computing projects including Riesel Sieve and PrimeGrid. A revised version, LLR2 was deployed in 2020. This generates a "proof of work" certificate which allows...

algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder...

poet V. A. Sundaram (1896 –1967), an activist in the Indian Independence movement Vivan Sundaram (born 1943), Indian artist Sieve of Sundaram, a method...

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...

Lucas primality test Miller–Rabin primality test Sieve of Atkin Sieve of Eratosthenes Sieve of Sundaram Backward Euler method Euler method Linear multistep...

computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory...

completed with a highly optimized implementation of the general number field sieve run on hundreds of machines. No algorithm has been published that can...

factorization method is a technique for factoring a number by writing it as a sum of two squares in two different ways. For example the number 1000009 {\displaystyle...

theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in...

Pollard described the application of his algorithm to the discrete logarithm problem in the multiplicative group of units modulo a prime p, it is in fact...