{
  "id": "nv08-rigorous-aks",
  "categoryId": "svp-provable",
  "paperId": "paper-601546f46af3",
  "date": "2008-09-11",
  "datePrecision": "day",
  "year": 2008,
  "time": {
    "coefficient": 5.9,
    "expression": "2^{5.9 n + o(n)}"
  },
  "space": {
    "coefficient": 2.95,
    "expression": "2^{2.95 n + o(n)}"
  },
  "tags": [
    "classical",
    "provable",
    "arbitrary lattices"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "Theorem 3.1 gives the rigorous exact-SVP AKS analysis. This is a different claim from this paper’s heuristic (4/3)^n sieve already in the database. The theorem’s guarantee and constants were read directly in the author PDF. The date follows the existing institutional-repository online-publication chronology.",
  "extra": {
    "norm": "Euclidean ℓ₂",
    "success": "Exponentially close to 1",
    "model": "Classical; polynomial input-size factors suppressed"
  },
  "evidence": {
    "url": "https://people.csail.mit.edu/vidick/JoMC08.pdf",
    "locator": "Theorem 3.1, printed p. 5 (PDF p. 5); parameter optimization, printed p. 12",
    "sourceVersion": "Author manuscript, To appear in J. Math. Crypt. (2008)"
  }
}