Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
List of algorithms
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Number theoretic algorithms=== {{further|Number theory}} * [[Binary GCD algorithm]]: Efficient way of calculating GCD. * [[Booth's multiplication algorithm]] * [[Chakravala method]]: a cyclic algorithm to solve indeterminate quadratic equations, including [[Pell's equation]] * [[Discrete logarithm]]: ** [[Baby-step giant-step]] ** [[Index calculus algorithm]] ** [[Pollard's rho algorithm for logarithms]] ** [[Pohlig–Hellman algorithm]] * [[Euclidean algorithm]]: computes the [[greatest common divisor]] * [[Extended Euclidean algorithm]]: also solves the equation ''ax'' + ''by'' = ''c'' * [[Integer factorization]]: breaking an integer into its [[prime number|prime]] factors ** [[Congruence of squares]] ** [[Dixon's algorithm]] ** [[Fermat's factorization method]] ** [[General number field sieve]] ** [[Lenstra elliptic curve factorization]] ** [[Pollard's p − 1 algorithm|Pollard's ''p'' − 1 algorithm]] ** [[Pollard's rho algorithm]] ** [[prime factorization algorithm]] ** [[Quadratic sieve]] ** [[Shor's algorithm]] ** [[Special number field sieve]] ** [[Trial division]] * [[Multiplication algorithm]]s: fast multiplication of two numbers ** [[Karatsuba algorithm]] ** [[Schönhage–Strassen algorithm]] ** [[Toom–Cook multiplication]] * [[Modular square root]]: computing square roots modulo a prime number ** [[Tonelli–Shanks algorithm]] ** [[Cipolla's algorithm]] ** [[Berlekamp's root finding algorithm]] * [[Odlyzko–Schönhage algorithm]]: calculates nontrivial zeroes of the [[Riemann zeta function]] * [[Lenstra–Lenstra–Lovász lattice basis reduction algorithm|Lenstra–Lenstra–Lovász algorithm]] (also known as LLL algorithm): find a short, nearly orthogonal [[Lattice (group)|lattice]] [[Basis (linear algebra)|basis]] in polynomial time * [[Primality test]]s: determining whether a given number is [[prime number|prime]] ** [[AKS primality test]] ** [[Baillie–PSW primality test]] ** [[Fermat primality test]] ** [[Lucas primality test]] ** [[Miller–Rabin primality test]] ** [[Sieve of Atkin]] ** [[Sieve of Eratosthenes]] ** [[Sieve of Sundaram]]
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
List of algorithms
(section)
Add topic