Skip to Main content Skip to Navigation
Journal articles

Certified lattice reduction

Abstract : Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra–Lenstra–Lovász reduction algorithm (so-called LLL) has been improved in many ways through the past decades and remains one of the central methods used for reducing integral lattice basis. In particular, its floating-point variants---where the rational arithmetic required by Gram–Schmidt orthogonalization is replaced by floating-point arithmetic---are now the fastest known. However, the systematic study of the reduction theory of real quadratic forms or, more generally, of real lattices is not widely represented in the literature. When the problem arises, the lattice is usually replaced by an integral approximation of (a multiple of) the original lattice, which is then reduced. While practically useful and proven in some special cases, this method doesn't offer any guarantee of success in general. In this work, we present an adaptive-precision version of a generalized LLL algorithm that covers this case in all generality. In particular, we replace floating-point arithmetic by Interval Arithmetic to certify the behavior of the algorithm. We conclude by giving a typical application of the result in algebraic number theory for the reduction of ideal lattices in number fields.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02383752
Contributor : Antoine Joux <>
Submitted on : Thursday, November 28, 2019 - 2:01:49 AM
Last modification on : Saturday, March 28, 2020 - 1:54:46 AM

Links full text

Identifiers

Citation

Thomas Espitau, Antoine Joux. Certified lattice reduction. Advances in Mathematics of Communications, AIMS, 2020, 14 (1), pp.137-159. ⟨10.3934/amc.2020011⟩. ⟨hal-02383752⟩

Share

Metrics

Record views

144