Metraipolis › archive › dc_bab945e201f5

On the Complexity of Locally Dense Lattices — arXiv:2608.14975

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.14975
License (as archived)
CC0-1.0
Archived
2026-10-19T00:29:36.714Z
SHA-256 of the archived text
5fcf5cb64db88f05be614e56b4a9109703d0db801d875e49455b35b0f402f80a
Stable URL of this page
https://metraipolis.com/documento/dc_bab945e201f5

How to cite

On the Complexity of Locally Dense Lattices — arXiv:2608.14975 — arXiv (en), https://arxiv.org/abs/2608.14975 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bab945e201f5 (Metraipolis archive dc_bab945e201f5, sha256 5fcf5cb64db88f05be614e56b4a9109703d0db801d875e49455b35b0f402f80a)
BibTeX
@misc{dcbab945e201f5,
  title = {On the Complexity of Locally Dense Lattices — arXiv:2608.14975},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.14975},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bab945e201f5; sha256 5fcf5cb64db88f05be614e56b4a9109703d0db801d875e49455b35b0f402f80a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.14975. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

\emph{Locally dense lattices} are central gadgets used to prove the hardness of the Shortest Vector Problem and related lattice problems. Informally, a locally dense lattice is a lattice $\mathcal{L}$ that contains exponentially many lattice vectors inside some $\ell_p$ ball centered at $\vec{s}$ with radius at most an $\alpha < 1$ fraction of the length of its shortest nonzero lattice vector. In this paper, taking a ``meta'' viewpoint on locally dense lattices, we introduce the \emph{Locally Dense Lattice Problem} (LDLP), the decision problem of determining whether a given input specifies a locally dense lattice. Our main result is that LDLP in $\ell_p$ norms for all finite $p \geq \log_2 3$ and for the infinity norm is complete for the second level of the polynomial hierarchy. We also compare two standard definitions of local density that appear in prior work. Micciancio's original definition (FOCS 1998 and SICOMP 2001) uses integer coefficient vectors, while later work by Micciancio (ToC 2012) and by Bennett and Peikert (RANDOM 2023) uses short vectors in a shifted coset. We show that the corresponding promise problems are mutually reducible in deterministic polynomial time, which shows that the two formulations are robust.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in cs.CC).
Categorie arXiv: Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2608.14975 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T23:35:48.553Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).