# Category:Number theoretic algorithms

Computing portal |

Here is a list of articles in the category **Number theoretic algorithms** of the Computing portal that unifies foundations of mathematics and computations using computers.

Wikimedia Commons has media related to .Number theoretic algorithms |

This category deals with **algorithms** in **number theory**, especially primality testing and similar.

## Subcategories

This category has only the following subcategory.

### I

## Pages in category "Number theoretic algorithms"

The following 24 pages are in this category, out of 24 total.

### A

- Ancient Egyptian multiplication
*(computing)*

### B

- Baby-step giant-step
*(computing)* - Berlekamp's root finding algorithm
*(computing)* - Berlekamp–Rabin algorithm
*(computing)* - Bhaskara's lemma
*(computing)* - Binary GCD algorithm
*(computing)*

### C

- Chakravala method
*(computing)* - Cipolla's algorithm
*(computing)* - Computational complexity of mathematical operations
*(computing)* - Cornacchia's algorithm
*(computing)*

### E

- Euclidean algorithm
*(computing)* - Extended Euclidean algorithm
*(computing)*

### G

- Generating primes
*(computing)* - Generation of primes
*(computing)*

### I

- Integer relation algorithm
*(computing)* - Integer square root
*(computing)*

### L

- Lehmer's GCD algorithm
*(computing)*

### M

- Meissel–Lehmer algorithm
*(computing)* - Modular exponentiation
*(computing)*

### P

- Pocklington's algorithm
*(computing)* - Pollard's kangaroo algorithm
*(computing)* - Pollard's rho algorithm for logarithms
*(computing)*

### R

- Rational reconstruction (mathematics)
*(computing)*

### T

- Tonelli–Shanks algorithm
*(computing)*