Approximate Voronoi cells for lattices, revisited
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis–Laarhoven–De Weger [PQCrypto, 2019] of determining exact asymptotics on the volume of these Voronoi cells under...
Main Author: | Laarhoven Thijs |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2020-11-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2020-0074 |
Similar Items
-
NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON
by: FRANCISCO SANTOS, et al.
Published: (2017-01-01) -
Empty simplices of large width
by: Joseph Doolittle, et al.
Published: (2025-01-01) -
Vines and MAT-labeled graphs
by: Hung Manh Tran, et al.
Published: (2024-01-01) -
Elliptic curve and k-Fibonacci-like sequence
by: Zakariae Cheddour, et al.
Published: (2023-07-01) -
New lattice attacks on DSA schemes
by: Poulakis Dimitrios
Published: (2016-06-01)