User:Valacmur98/sandbox

Template:Number-theoretic algorithms From Wikipedia, the free encyclopedia [hide]

v   t    e

'''Number-theoretic algorithms Primality tests '''   AKS test APR test Baillie–PSW Elliptic curve Pocklington Fermat Lucas Lucas–Lehmer Lucas–Lehmer–Riesel Proth's theorem Pépin's   Quadratic Frobenius test Solovay–Strassen Miller–Rabin

Prime-generating

Sieve of Atkin Sieve of Eratosthenes Sieve of Sundaram Wheel factorization

Integer factorization

Continued fraction (CFRAC) Dixon's   Lenstra elliptic curve (ECM) Euler's   Pollard's rho p − 1 p + 1 Quadratic sieve (QS) General number field sieve (GNFS) Special number field sieve (SNFS) Rational sieve Fermat's   Shanks' square forms Trial division Shor's

Multiplication

Ancient Egyptian Long Karatsuba Toom–Cook Schönhage–Strassen Fürer's

Discrete logarithm

Baby-step giant-step Pollard rho Pollard kangaroo Pohlig–Hellman Index calculus Function field sieve

Greatest common divisor

Binary Euclidean Extended Euclidean Lehmer's

Modular square root

Cipolla Pocklington's   Tonelli–Shanks

Other algorithms

Chakravala Cornacchia LLL Integer square root Modular exponentiation Schoof's

Italics indicate that algorithm is for numbers of special forms