vf_node_title_variants
| ANGOL CÍM | Number-theoretic algorithms | 11081 |
field_in_importance
2
vf_node_webs
vf_node_items
| vf_node_pictures_all | title (item) | field_cer_web | field_cer_navbox | g_geofield | field_t_coordinates | |
|---|---|---|---|---|---|---|
| prímfelbontás (törzstényezős felbontás, prímfaktorizáció) - integer factorization - Primfaktorzerlegung - Факторизация целых чисел |
body
| Number-theoretic algorithms | |
|---|---|
| Primality tests | AKS • APR • Baillie-PSW • Elliptic curve • Pocklington • Fermat • Lucas • Lucas-Lehmer • Lucas-Lehmer-Riesel • Proth's theorem • Pépin's • Quadratic Frobenius • Solovay-Strassen • Miller-Rabin |
| Prime | Sieve of Atkin • Sieve of Eratosthenes • Sieve of Pritchard • Sieve of Sundaram • Wheel factorization |
| Integer factorization | Continued fraction (CFRAC) • Dixon's • Lenstra elliptic curve (ECM) • Euler's • Pollard's rho • p − 1 • p + 1 • Quadratic sieve (QS) • General number field sieve (GNFS) • Special number field sieve (SNFS) • Rational sieve • Fermat's • Shanks's square forms • Trial division • Shor's |
| Multiplication | Ancient Egyptian • Long • Karatsuba • Toom-Cook • Schönhage-Strassen • Fürer's |
| Euclidean division | Binary • Chunking • Fourier • Goldschmidt • Newton-Raphson • Long • Short • SRT |
| Discrete logarithm | Baby-step giant-step • Pollard rho • Pollard kangaroo • Pohlig-Hellman • Index calculus • Function field sieve |
| Greatest common divisor | Binary • Euclidean • Extended Euclidean • Lehmer's |
| Modular square root | Cipolla • Pocklington's • Tonelli-Shanks • Berlekamp |
| Other algorithms | Chakravala • Cornacchia • Exponentiation by squaring • Integer square root • Integer relation (LLL; KZ) • Modular exponentiation • Montgomery reduction • Schoof • Trachtenberg system |
| Italics indicate that algorithm is for numbers of special forms | |
fr_importance