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.
Cryptanalysis of rank-2 module- lip: A single real embedding is all it takes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative 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.