A verified LLL algorithm

  1. Maximilian Haslbeck
  2. Akihisa Yamada
  3. Sebastiaan Joosten
  4. René Thiemann
  5. Jose Divasón
  6. Ralph Bottesch
Revue:
Archive of Formal Proofs

ISSN: 2150-914x

Année de publication: 2018

Pages: 1-251

Type: Article

GOOGLE SCHOLAR lock_openAccès ouvert editor
Dépôt institutionnel: lock_openAccès ouvert Editor

Projets liés

Álgebra computacional: formalización y aplicaciones a la fiabilidad de redes y al prcesamiento de imágenes biomédicas.

2018/00009/001

Résumé

The Lenstra-Lenstra-Lovász basis reduction algorithm, also known as LLL algorithm, is an algorithm to find a basis with short, nearly orthogonal vectors of an integer lattice. Thereby, it can also be seen as an approximation to solve the shortest vector problem (SVP), which is an NP-hard problem, where the approximation quality solely depends on the dimension of the lattice, but not the lattice itself. The algorithm also possesses many applications in diverse fields of computer science, from cryptanalysis to number theory, but it is specially well-known since it was used to implement the first polynomial-time algorithm to factor polynomials. In this work we present the first mechanized soundness proof of the LLL algorithm to compute short vectors in lattices. The formalization follows a textbook by von zur Gathen and Gerhard.