A verified LLL algorithm

Jose Divasón, Sebastiaan Joosten, René Thiemann, Akihisa Yamada

    Research output: Contribution to journalArticleAcademic

    45 Downloads (Pure)

    Abstract

    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.
    Original languageEnglish
    JournalArchive of Formal Proofs
    Volume2018
    Publication statusPublished - 2018

    Fingerprint Dive into the research topics of 'A verified LLL algorithm'. Together they form a unique fingerprint.

    Cite this