Template:Number-theoretic algorithms: Difference between revisions

Revision as of 01:30, 13 September 2019

Revision as of 01:40, 13 September 2019

Line 56:

* [[Fürer's algorithm|Fürer's]]

| group5 = [[DiscreteDivision logarithmalgorithm|Division]]

| list5 =

* [[LongChunking (division)|Chunking]]

* [[Fourier division|Fourier]]

* [[Newton–Raphson division|Newton-Raphson]]

* [[Long division|Long]]

* [[Short division|Short]]

* [[SRT division|SRT]]

| group6 = [[Discrete logarithm]]

| list6 =

* [[Baby-step giant-step]]

* [[Pollard's rho algorithm for logarithms|Pollard rho]]

Line 65 ⟶ 74:

* [[Function field sieve]]

| group6group7 = [[Greatest common divisor]]

| list6list7 =

* [[Binary GCD algorithm|Binary]]

* [[Euclidean algorithm|Euclidean]]

Line 72 ⟶ 81:

* [[Lehmer's GCD algorithm|Lehmer's]]

| group7group8 = [[Quadratic residue|Modular square root]]

| list7list8 =

* [[Cipolla's algorithm|Cipolla]]

* [[Pocklington's algorithm|Pocklington's]]

Line 80 ⟶ 89:

| group8group9 = Other algorithms

| list8list9 =

* [[Chakravala method|Chakravala]]

* [[Cornacchia's algorithm|Cornacchia]]

Line 87 ⟶ 96:

* [[Integer square root]]

* [[Lenstra–Lenstra–Lovász lattice basis reduction algorithm|LLL]]

* [[Long division]]

* [[Modular exponentiation]]

* [[Montgomery reduction]]