Superlattice methods for the shortest vector problem and discrete Gaussian sampling

Minki Hhan · Jiseung Kim · Sunyeop Kim · Thijs Laarhoven

ePrint 2026/2761

Time bound

2^{0.2469 n + o(n)}

Space bound

2^{0.247 n + o(n)}

Source / version date

4 Nov 2026

Comparison variant

Quantum · worst case

Cost scale

2^{c n + o(n)}

Computation model

Quantum; worst-case exact Euclidean SVP

precision

Public abstract rounds to 0.247; author-supplied 0.2469

Assumptions and source notes

The public abstract states worst-case quantum time and space 2^{0.247n+o(n)}. The more precise 0.2469 is supplied by coauthor Thijs Laarhoven in this update; full-PDF precision was not independently checked.

Source location

Abstract; finer decimal supplied by coauthor
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}
}