Corpus ID: 195874189

Approximate Voronoi cells for lattices, revisited

@article{Laarhoven2019ApproximateVC,
  title={Approximate Voronoi cells for lattices, revisited},
  author={Thijs Laarhoven},
  journal={ArXiv},
  year={2019},
  volume={abs/1907.04630}
}
  • Thijs Laarhoven
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • 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 the Gaussian heuristic. As a result, we obtain improved upper bounds on the time complexity of the randomized iterative slicer when using less than $2^{0.076d + o(d)}$ memory, and we show how to… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 34 REFERENCES
    Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
    16
    A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
    104
    Finding Closest Lattice Vectors Using Approximate Voronoi Cells
    17
    New directions in nearest neighbor searching with applications to lattice sieving
    172
    Lattice problems in NP ∩ coNP
    149
    Fast Lattice Point Enumeration with Minimal Overhead
    52
    Sieve algorithms for the shortest vector problem are practical
    155
    Faster exponential time algorithms for the shortest vector problem
    171
    Improved algorithms for integer programming and related lattice problems
    373