arXiv (All)
open access
Dual lattice attacks for bounded distance decoding, revisited
Analyses of dual lattice attacks have often assumed that the individual scores associated with short dual vectors are mutually independent. Laarhoven-Walter used this heuristic to derive explicit trade-offs between the target radius and query time for bounded distance decoding (BDD) with preprocessi
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
- Local Gains and Fixed-Assignment Set Losses in Shared Set Decoders#609150
- The non-spherical sup-norm problem for $\mathrm{GL}(n)$ and generalized spherical functions#1013327
- Structured lattices and their applications to security#287057
- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049
- Spaces with the maximal projection constant revisited#1108928
Record · ID 1141805
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