Talk:Lattice reduction

The LLL Algorithm is but one Lattice basis reduction algorithm. In fact the LLL Algorithm is sub-optimal. Other Lattice basis reduction algorithms include the KZ algorithm. I would think this page should be a list of known Lattice basis reduction algorithms rather than redirecting to a particular one.

This page does not cite MathWorld, even though the Applications section is clearly lifted verbatim from there. —Preceding unsigned comment added by 67.241.45.203 (talk) 15:37, 30 January 2009 (UTC)

Algorithms
The "Algorithms" list could be much longer. One possible addition is a sieving algorithm, for which one reference is "A sieve algorithm for the shortest lattice vector problem" by Miklós Ajtai, Ravi Kumar, D. Sivakumar, Proceedings of the thirty-third annual ACM symposium on Theory of computingJuly 2001. Another important algorithm is "Hermite-Korkine-Zolotarev" reduction, for which one reference is P. Q. Nguyen and B. Vall´ee, Eds., The LLL Algorithm: Survey and Applications. Berlin, Germany: Springer-Verlag, 2009. Sanpitch (talk) 06:06, 14 December 2021 (UTC)

See also https://eprint.iacr.org/2023/237 — Preceding unsigned comment added by 5.57.21.50 (talk) 15:18, 30 October 2023 (UTC)