arXiv (All)
open access
Optimal Sample Exponents for Direct Discrete-Gaussian SVP Search on Haar Random Lattices
We determine the optimal sample exponent for direct discrete Gaussian SVP search on Haar random unimodular lattices, counting zero outputs. The output is one sampled vector, optionally divided by the greatest common divisor of its lattice coordinates. For every fixed approximation factor $1\leqγ<\sq
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Faster SVP in Polynomial Space#1036008
- GateANN: I/O-Efficient Filtered Vector Search on SSDs#2717
- Dual lattice attacks for bounded distance decoding, revisited#1141805
- Particle mesh Ewald: An <i>N</i>⋅log(<i>N</i>) method for Ewald sums in large systems#6311
- Algorithmic number theory, Vol. 1: Efficient algorithms#490163
Record · ID 1105367
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive