Module lattices and their shortest vectors
By: Nihar Gargava , Vlad Serban , Maryna Viazovska and more
Potential Business Impact:
Finds shortest paths in complex math structures.
We study the shortest vector lengths in module lattices over arbitrary number fields, with an emphasis on cyclotomic fields. In particular, we sharpen the techniques of arXiv:2308.15275v2 to establish improved results for the variance of the number of lattice vectors of bounded Euclidean norm in a random module lattice. We then derive tight probabilistic bounds for the shortest vector lengths for several notions of random module lattice.
Similar Papers
Principal ideal problem and ideal shortest vector over rational primes in power-of-two cyclotomic fields
Cryptography and Security
Finds hidden math secrets for super-secure computers.
On lattices over Fermat function fields
Algebraic Geometry
Creates better codes for secret messages.
A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
Optimization and Control
Finds tiniest math grid steps quickly