Superlattice methods for the shortest vector problem and discrete Gaussian sampling

Minki Hhan · Jiseung Kim · Sunyeop Kim · Thijs Laarhoven

ePrint 2026/2761

Time bound

(3/2)^{n/2 + o(n)}

Space bound

(4/3)^{n/2 + o(n)}

Source / version date

4 Nov 2026

Comparison variant

Classical · Haar random

Cost scale

2^{c n + o(n)}

Computation model

Classical; Haar-random lattices

Assumptions and source notes

Abstract states this bound for Haar-random lattices; no worst-case Haar identification is implied. The abstract says these bounds match Becker–Ducas–Gama–Laarhoven; exact normalization avoids treating rounded 0.292 as a new improvement over the same constant.

Source location

Abstract, Haar-random clause
Version: 2026-11-04

Primary source ↗

@misc{paper-c70730f20075,
  author = {Minki Hhan and Jiseung Kim and Sunyeop Kim and Thijs Laarhoven},
  title = {{Superlattice methods for the shortest vector problem and discrete Gaussian sampling}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/2761},
  cr_date = {2026-11-04},
  cr_status = {preprint},
  cr_author_ids = {minki-hhan; jiseung-kim; sunyeop-kim; thijs-laarhoven},
  howpublished = {Cryptology ePrint Archive, Paper 2026/2761}
}