Computing an LLL-reduced Basis of the Orthogonal Lattice - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Computing an LLL-reduced Basis of the Orthogonal Lattice

Damien Stehlé
  • Fonction : Auteur
  • PersonId : 837772
Gilles Villard

Résumé

As a typical application, the Lenstra-Lenstra-Lovász lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such bases in input, we propose a new technique for bounding from above the number of iterations required by the LLL algorithm. The main technical ingredient is a variant of the classical LLL potential, which could prove useful to understand the behavior of LLL for other families of input bases.

Domaines

Informatique
Fichier principal
Vignette du fichier
hal.pdf (750.65 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01921335 , version 1 (13-11-2018)

Identifiants

Citer

Jingwei Chen, Damien Stehlé, Gilles Villard. Computing an LLL-reduced Basis of the Orthogonal Lattice. ISSAC 2018, 43rd International Symposium on Symbolic and Algebraic Computation (ISSAC 2018), Jul 2018, New York, United States. ⟨10.1145/3208976.3209013⟩. ⟨hal-01921335⟩
116 Consultations
488 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More