Category
page 1Number theoretic algorithms
Euclidean algorithm
algorithm for computing greatest common divisors
extended Euclidean algorithm
algorithm for computing the coefficients of Bézout's Identity
modular exponentiation
type of exponentiation performed over a modulus
Ancient Egyptian multiplication
multiplication algorithm
binary GCD algorithm
algorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction
Chakravala method
cyclic algorithm to solve indeterminate quadratic equations
baby-step giant-step
algorithm for solving the discrete logarithm problem
Pohlig–Hellman algorithm
algorithm for computing discrete logarithms
Pollard's rho algorithm for logarithms
probabilistic algorithm that computes discrete logarithms
integer square root
number-theoretic function: floor of the square root
Generating primes
algorithms to generate prime numbers
Pollard's kangaroo algorithm
algorithm for computing the discrete logarithm
Lamé's theorem
analysis of the complexity of Euclidean algorithm
Computational complexity of mathematical operations
algorithmic runtime requirements for common math procedures