arXiv (All)
open access
Adelic reduction of module lattices
We give a strict generalization of the LLL algorithm over number fields, based on the reduction theory of $\GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. As a consequence, we obtain a hierarchy of reductions
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
- Internet X.509 Public Key Infrastructure -- Algorithm Identifiers for the Module-Lattice-Based Digital Signature Algorithm (ML-DSA)#131611
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)#1033960
- Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography#200399
- CVP Is NP-Complete for Principal Cyclotomic Ideals#1035598
- Algebraic Proof of Completeness of a Positional Numeral System in the Normalized Mersenne Basis#1051584
Record · ID 1117648
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