The L² CVP distance to the log-unit lattice converges to (π/(2√6))√n, enabling sub-polynomial approximation factors for the Short Generator Problem and reducing the CDPR factor for ML-KEM from exp(O(√n)) to sub-polynomial.
Wiley, New York, 2nd edition, 1999
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
citing papers explorer
-
Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice
The L² CVP distance to the log-unit lattice converges to (π/(2√6))√n, enabling sub-polynomial approximation factors for the Short Generator Problem and reducing the CDPR factor for ML-KEM from exp(O(√n)) to sub-polynomial.
- Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics