HN 日本語サマリー

← 一覧へ戻る
AI・機械学習

中間点ヘッセ行列による最短ベクトル問題の$2^{0.6039n}$時間での解法

Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-Point Hessian (arxiv.org)

31 pointsby sbulaev12 コメント

要約

本論文では、最短ベクトル問題(SVP)に対する確率的アルゴリズムを提案しています。提案手法は、古典計算で$2^{0.6039n+o(n)}$時間、量子計算で$2^{0.5411n+o(n)}$時間、空間計算量で$2^{0.5n+o(n)}$でSVPを解くことができ、既存の最良アルゴリズムを大幅に改善します。

全文翻訳

Computer Science > Data Structures and Algorithms

arXiv:2608.02478 (cs)

[Submitted on 3 Aug 2026 (v1), last revised 4 Aug 2026 (this version, v2)]

Title:Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian

Authors:Minki Hhan

View a PDF of the paper titled Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian, by Minki Hhan

View PDF HTML (experimental)

Abstract:We present randomized algorithms for the shortest vector problem (SVP). For the $n$-dimensional lattice $\mathcal L$, our algorithms solve SVP in time $2^{0.6039n+o(n)}$ classically and $2^{0.5411n+o(n)}$ quantumly and space $2^{0.5n+o(n)}$, improving the previous best algorithm running in $2^{n+o(n)}$ time and space of Aggarwal, Dadush, Regev, and Stephens-Davidowitz [STOC'15].
Our algorithms heavily use the property of the Hessian of the periodic Gaussian function at the half shortest vector: For a shortest vector $v \in \mathcal L$, the Hessian at $v/2$ has the eigenvector close to $v$, which can be used to recover $v$ using the (preprocessing) bounded distance decoding algorithm. Given the periodicity modulo $\mathcal L$, the candidate midpoints are indexed by the parity classes in $\mathcal L/2\mathcal L$. Our algorithm searches for the class of a shortest vector by estimating the corresponding Hessians using discrete Gaussian samples.
We optimize the algorithm using random sublattice cosets and various sampling technique, achieving the final complexity. The optimization techniques may be of independent interest.

Comments:Corrected title
Subjects:Data Structures and Algorithms (cs.DS); Cryptography and Security (cs.CR)
Cite as:arXiv:2608.02478 [cs.DS]
(or arXiv:2608.02478v2 [cs.DS] for this version)
https://doi.org/10.48550/arXiv.2608.02478 arXiv-issued DOI via DataCite

Submission history

From: Minki Hhan

v1 Mon, 3 Aug 2026 16:46:49 UTC (6,884 KB)
v2 Tue, 4 Aug 2026 03:43:30 UTC (6,885 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian, by Minki Hhan

[画像: license icon] view license

Additional Features
Current browse context:

cs.DS

< prev   |   next >

new | recent | 2026-08

Change to browse by:

cs
cs.CR

References & Citations

Loading...

BibTeX formatted citation

loading...

Data provided by:

Bookmark

[画像: BibSonomy][画像: Reddit]

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

  • Author
  • Venue
  • Institution
  • Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)