{
  "id": "bls16-triple-filtered-unrestricted",
  "categoryId": "svp-heuristic",
  "paperId": "bai-laarhoven-stehle-2016",
  "date": "2016-07-21",
  "year": 2016,
  "time": {
    "coefficient": 0.4812,
    "expression": "2^{0.4812 n + o(n)}"
  },
  "space": {
    "coefficient": 0.1887,
    "expression": "2^{0.1887 n + o(n)}"
  },
  "tags": [
    "heuristic",
    "triple sieving",
    "memory tradeoff"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "Introduces tuple sieving to reduce the sieve-list memory. The representative filtered triple-sieve point is included in the unrestricted heuristic SVP literature even though it does not improve the standing time exponent. Pair filtering before the third-vector search.",
  "extra": {
    "model": "Classical; heuristic spherical lists",
    "preprocessing": "Included in asymptotic analysis",
    "reference": "Abstract; Section 4"
  },
  "evidence": {
    "url": "https://eprint.iacr.org/2016/713",
    "locator": "Abstract; Section 4",
    "sourceVersion": "ePrint 2016/713; first received 21 July 2016; published text August 2016"
  }
}