Algorithms
The following algorithms reduce lattice bases. They can be compared in terms of runtime and approximation to an optimal solution, always relative to the dimension of the given lattice. If there are public implementations of these algorithms this should also be noted here.
| Year | Algorithm | Name | Implementation |
|---|---|---|---|
| 1982 | LLL | Lenstra Lenstra Lovász | NTL |
| 1987 | BKZ | Block Korkine Zolotarev | NTL |
| 2002 | RSR | Random Sampling Reduction | |
| 2002 | PDR | Primal Dual Reduction |
Read more about this topic: Lattice Reduction