{
  "id": "bl16-crosspolytope",
  "categoryId": "svp-heuristic",
  "paperId": "paper-777c2d2d89d5",
  "year": 2016,
  "date": "2015-08-24",
  "time": {
    "coefficient": 0.2972,
    "expression": "2^{0.2972 n + o(n)}"
  },
  "space": {
    "coefficient": null,
    "expression": ""
  },
  "tags": [],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "AFRICACRYPT 2016; first ePrint 24 August 2015. Independently reaches the 0.298 time level through efficiently computable cross-polytope hashes, improving practicality over SphereSieve. The abstract applies to arbitrary and ideal lattices. A numeric space coefficient is not inferred from the abstract; consult the chosen variant. Theorem 1 gives 0.2972, often rounded to 0.298 in the abstract; this is a precision normalization, not a new algorithmic improvement.",
  "extra": {
    "norm": "Euclidean ℓ₂",
    "success": "Under the stated sieve heuristic",
    "model": "Classical randomized; polynomial factors suppressed",
    "heuristic": "GaussSieve heuristic; cross-polytope LSH",
    "reference": "BL16"
  },
  "evidence": {
    "url": "https://eprint.iacr.org/2015/823",
    "locator": "Theorem 1; identical asymptotic collision analysis to spherical LSH",
    "sourceVersion": "AFRICACRYPT 2016 paper, originally ePrint 2015/823"
  }
}