We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in O(n) operations, where n is the dimension of the lattice. To achieve this a series of relevant lattice vectors that converges to a closest lattice point is found. We show that the series converges after at most n terms. Each vector in the series can be efficiently computed in O(n) operations using an algorithm to compute a minimum cut in an undirected flow network
AbstractWe prove that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate...
We present a new efficient algorithm for the search version of the approximate Closest Vector Proble...
We revisit the approximate Voronoi cells approach for solving the closest vector problem with prepro...
In this semitutorial paper, a comprehensive survey of closest point search methods for lattices with...
Improving on the Voronoi cell based techniques of [28, 24], we give a Las Vegas eO (2n) expected t...
The problem of finding the closest lattice point arises in several communications scenarios and is k...
The lattice A* is an important lattice because of its covering properties in low dimensions. Clarkso...
Abstract. We present the state of the art solvers of the Shortest and Closest Lattice Vector Problem...
The shortest vector problem (SVP) and closest vector problem (CVP) are the most widely known problem...
htmlabstractWe give a deterministic algorithm for solving the $(1+\eps)$-approximate Closest Vector...
We give deterministic Õ(22n)-time Õ(2n)-space algorithms to solve all the most important computa-t...
We give a 2n+o(n)-time and space randomized algorithm for solving the exact Closest Vector Problem ...
The two traditional hard problems underlying the security of lattice-based cryptography are the shor...
We give deterministic Õ(22n)-time and Õ(2n)-space algorithms to solve all the most important com-p...
In this note we give a polynomial time algorithm for solving the closest vector problem in the class...
AbstractWe prove that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate...
We present a new efficient algorithm for the search version of the approximate Closest Vector Proble...
We revisit the approximate Voronoi cells approach for solving the closest vector problem with prepro...
In this semitutorial paper, a comprehensive survey of closest point search methods for lattices with...
Improving on the Voronoi cell based techniques of [28, 24], we give a Las Vegas eO (2n) expected t...
The problem of finding the closest lattice point arises in several communications scenarios and is k...
The lattice A* is an important lattice because of its covering properties in low dimensions. Clarkso...
Abstract. We present the state of the art solvers of the Shortest and Closest Lattice Vector Problem...
The shortest vector problem (SVP) and closest vector problem (CVP) are the most widely known problem...
htmlabstractWe give a deterministic algorithm for solving the $(1+\eps)$-approximate Closest Vector...
We give deterministic Õ(22n)-time Õ(2n)-space algorithms to solve all the most important computa-t...
We give a 2n+o(n)-time and space randomized algorithm for solving the exact Closest Vector Problem ...
The two traditional hard problems underlying the security of lattice-based cryptography are the shor...
We give deterministic Õ(22n)-time and Õ(2n)-space algorithms to solve all the most important com-p...
In this note we give a polynomial time algorithm for solving the closest vector problem in the class...
AbstractWe prove that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate...
We present a new efficient algorithm for the search version of the approximate Closest Vector Proble...
We revisit the approximate Voronoi cells approach for solving the closest vector problem with prepro...