algorithm in number theory
C48726
concept
An algorithm in number theory is a finite, well-defined computational procedure designed to solve problems involving integers and their properties, such as divisibility, primality, and modular relationships.
Observed surface forms (11)
- elliptic curve algorithm ×2
- ancient algorithm ×1
- computational number theory algorithm ×1
- computational number theory method ×1
- elliptic-curve method ×1
- greatest common divisor algorithm ×1
- integer factorization algorithm ×1
- number theory algorithm ×1
- number-theoretic construction ×1
- point-counting algorithm ×1
- prime number algorithm ×1
Instances (9)
- Selfridge–Conway primality test
- Euclidean algorithm for polynomials via concept surface "greatest common divisor algorithm"
- AKS primality test via concept surface "number theory algorithm"
- Miller primality test
- Schoof–Elkies–Atkin (SEA) point-counting algorithm via concept surface "point-counting algorithm"
- Lenstra elliptic-curve factorization method via concept surface "integer factorization algorithm"
- Montgomery ladder via concept surface "elliptic curve algorithm"
- Naor–Reingold pseudorandom function via concept surface "number-theoretic construction"
- sieve of Eratosthenes via concept surface "prime number algorithm"