Faster algorithms for SVP and CVP in the ℓ_∞ norm

01/08/2018
by   Divesh Aggarwal, et al.
0

Blomer and Naewe[BN09] modified the randomized sieving algorithm of Ajtai, Kumar and Sivakumar[AKS01] to solve the shortest vector problem (SVP). The algorithm starts with N = 2^O(n) randomly chosen vectors in the lattice and employs a sieving procedure to iteratively obtain shorter vectors in the lattice. The running time of the sieving procedure is quadratic in N. We study this problem for the special but important case of the ℓ_∞ norm. We give a new sieving procedure that runs in time linear in N, thereby significantly improving the running time of the algorithm for SVP in the ℓ_∞ norm. As in [AKS02],[BN09], we also extend this algorithm to obtain significantly faster algorithms for approximate versions of the shortest vector problem and the closest vector problem (CVP) in the ℓ_∞ norm. We also show that the heuristic sieving algorithms of Nguyen and Vidick [NV08] and Wang et.al.[WLTB11] can also be analyzed in the ℓ_∞ norm. The main technical contribution in this part is to calculate the expected volume of intersection of a unit ball centred at origin and another ball of a different radius centred at a uniformly random point on the boundary of the unit ball. This might be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2019

Faster provable sieving algorithms for the Shortest Vector Problem and the Closest Vector Problem on lattices in ℓ_p norm

In this paper we give provable sieving algorithms for the Shortest Vecto...
research
05/11/2020

Approximate CVP_∞ in time 2^0.802 n

We show that a constant factor approximation of the shortest and closest...
research
08/22/2019

Covering convex bodies and the Closest Vector Problem

We present algorithms for the (1+ϵ)-approximate version of the closest v...
research
07/19/2020

A 2^n/2-Time Algorithm for √(n)-SVP and √(n)-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP

We show a 2^n/2+o(n)-time algorithm that finds a (non-zero) vector in a ...
research
03/22/2020

Euclidean TSP in Narrow Strip

We investigate how the complexity of Euclidean TSP for point sets P insi...
research
03/26/2018

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH

The k-Even Set problem is a parameterized variant of the Minimum Distanc...
research
07/22/2021

The Traveling Firefighter Problem

We introduce the L_p Traveling Salesman Problem (L_p-TSP), given by an o...

Please sign up or login with your details

Forgot password? Click here to reset