Misplaced Pages

The following pages link to Template:Number-theoretic algorithms

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• Euclidean algorithm (transclusion) (links | edit)
• Greatest common divisor (transclusion) (links | edit)
• Integer factorization (transclusion) (links | edit)
• Shor's algorithm (transclusion) (links | edit)
• Multiplication algorithm (transclusion) (links | edit)
• Sieve of Eratosthenes (transclusion) (links | edit)
• Extended Euclidean algorithm (transclusion) (links | edit)
• General number field sieve (transclusion) (links | edit)
• Lenstra elliptic-curve factorization (transclusion) (links | edit)
• Fermat primality test (transclusion) (links | edit)
• Discrete logarithm (transclusion) (links | edit)
• Primality test (transclusion) (links | edit)
• Miller–Rabin primality test (transclusion) (links | edit)
• Long division (transclusion) (links | edit)
• Lucas–Lehmer primality test (transclusion) (links | edit)
• Toom–Cook multiplication (transclusion) (links | edit)
• Lucas primality test (transclusion) (links | edit)
• AKS primality test (transclusion) (links | edit)
• Computational number theory (transclusion) (links | edit)
• Trial division (transclusion) (links | edit)
• Baby-step giant-step (transclusion) (links | edit)
• Trachtenberg system (transclusion) (links | edit)
• Pollard's p − 1 algorithm (transclusion) (links | edit)
• Pollard's rho algorithm (transclusion) (links | edit)
• Quadratic sieve (transclusion) (links | edit)
• Special number field sieve (transclusion) (links | edit)
• Modular exponentiation (transclusion) (links | edit)
• Integer square root (transclusion) (links | edit)
• Binary GCD algorithm (transclusion) (links | edit)
• Solovay–Strassen primality test (transclusion) (links | edit)
• Dixon's factorization method (transclusion) (links | edit)
• Continued fraction factorization (transclusion) (links | edit)
• Schönhage–Strassen algorithm (transclusion) (links | edit)
• Index calculus algorithm (transclusion) (links | edit)
• Pollard's rho algorithm for logarithms (transclusion) (links | edit)
• Lenstra–Lenstra–Lovász lattice basis reduction algorithm (transclusion) (links | edit)
• Williams's p + 1 algorithm (transclusion) (links | edit)
• Pohlig–Hellman algorithm (transclusion) (links | edit)
• Fermat's factorization method (transclusion) (links | edit)
• Sieve of Atkin (transclusion) (links | edit)
• Generation of primes (transclusion) (links | edit)
• Rational sieve (transclusion) (links | edit)
• Proth's theorem (transclusion) (links | edit)
• Pépin's test (transclusion) (links | edit)
• Division algorithm (transclusion) (links | edit)
• Shanks's square forms factorization (transclusion) (links | edit)
• Schoof's algorithm (transclusion) (links | edit)
• Baillie–PSW primality test (transclusion) (links | edit)
• Tonelli–Shanks algorithm (transclusion) (links | edit)
• Ancient Egyptian multiplication (transclusion) (links | edit)