{
  "id": "2410.22196",
  "version": "v1",
  "published": "2024-10-29T16:33:37.000Z",
  "updated": "2024-10-29T16:33:37.000Z",
  "title": "LLL Algorithm for Lattice Basis Reduction",
  "authors": [
    "Alex Kalbach",
    "Ted Chinburg"
  ],
  "comment": "19 pages",
  "categories": [
    "math.NT"
  ],
  "abstract": "The purpose of this paper is to introduce and analyze the polynomial time lattice basis reduction algorithm first described by Arjen Lenstra, Hendrik Lenstra, and L\\'aszl\\'o Lov\\'asz in 1982. We begin by introducing the shortest vector problem, which motivates the underlying components of the LLL algorithm. Then, we introduce the details of the algorithm itself, followed by proofs of the correctness and runtime of the algorithm in complete detail, assuming only a basic linear algebra background and an understanding of big O notation. Finally, we apply the LLL algorithm to the shortest vector problem and explore other applications of the algorithm in various mathematical settings.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-10-29T16:33:37.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "lll algorithm",
      "shortest vector problem",
      "time lattice basis reduction algorithm",
      "polynomial time lattice basis reduction",
      "lattice basis reduction algorithm first"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}