Indefiniteness makes lattice reduction easier
Antoine Joux (CISPA, IMJ-PRG)

TL;DR
This paper explores indefinite lattice reduction, demonstrating that it can produce better reduced forms than previously thought, with approximation quality depending on the lattice's signature rather than its dimension.
Contribution
It shows that indefinite lattice reduction can yield significantly improved representations and that the approximation factor is influenced by the lattice's signature.
Findings
Indefinite lattice reduction can produce better reduced forms.
The approximation factor depends on the lattice's signature.
Previous assumptions about the limitations of indefinite reduction are challenged.
Abstract
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive definite scalar product. However, it seems quite nature to ask about the indefinite case, where the scalar product is replaced by an arbitrary quadratic form, possibily indefinite. This question was considered independently in two lines of work. One by G{\'a}bor Ivanyos and {\'A}gnes Sz{\'a}nt{\'o} and one by Denis Simon. Both lead to an algorithm that generalizes LLL and whose performance is very similar to LLL, i.e. a polynomial-time algorithm that approximates the shortest vector within an approximation factor exponential in the dimension. Denis Simon achieves an approximation factor close to that of LLL under the assumption that no isotropic vectors…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Polynomial and algebraic computation · Cryptography and Residue Arithmetic
