arXiv CS
open access
Provable Subexponential Algorithms for NIST Third-Round Lattice Families
We give provable classical subexponential algorithms for secret recovery in growing parameter families associated with NIST third-round lattice candidates. For the Kyber/ML-KEM, FrodoKEM, SABER, NTRU LPRime, and Dilithium/ML-DSA families studied here, polynomial moduli and polylogarithmic coefficien
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
- Provable Subexponential Algorithms for NIST Third-Round Lattice Families#1248181
- A Uniqueness Theorem for Exact Separable Log-Partition Decompositions#677695
- A Uniqueness Theorem for Exact Separable Log-Partition Decompositions#674494
- Untrodden pathways in the study of partitions with parts separated by parity#1343832
- MEGA: Object-Level Mesh Extraction from 3D Gaussian Splatting via Spatial Visual Distillation#1156978
Record · ID 1242706
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