Solving the Shortest Vector Problem in 2^(0.6039n) Time via Mid-point Hessian

Minki Hhan

ePrint 2026/1597

Time bound

2^{0.5411 n + o(n)}

Space bound

2^{0.5 n + o(n)}

Source / version date

3 Aug 2026

Comparison variant

Quantum · worst case

Cost scale

2^{c n + o(n)}

Norm

Euclidean ℓ₂

Success guarantee

Randomized

Computation model

Quantum; see source for operation and memory accounting

QRAM / coherent access

Consult full paper

reference

Hhan26a

Assumptions and source notes

Preprint abstract states quantum time 0.5411 and space 0.5. Access-model details must be checked in the paper before comparison with other quantum models. This starter category is incomplete and does not assert the current best quantum result.

Primary source ↗

@misc{paper-2fcc11c09e6a,
  author = {Minki Hhan},
  title = {{Solving the Shortest Vector Problem in 2^(0.6039n) Time via Mid-point Hessian}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1597},
  cr_date = {2026-08-03},
  cr_status = {preprint},
  cr_author_ids = {minki-hhan},
  howpublished = {Cryptology ePrint Archive, Paper 2026/1597}
}