Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes
share
We give a simple proof that the (approximate, decisional) Shortest Vector Problem is -hard under a randomized reduction. Specifically, we show that for any p ≥ 1 and any constant γ < 2^1/p, the γ-approximate problem in the ℓ_p norm (γ-_p) is not in 𝖱𝖯 unless ⊆𝖱𝖯. Our proof follows an approach pioneered by Ajtai (STOC 1998), and strengthened by Micciancio (FOCS 1998 and SICOMP 2000), for showing hardness of γ-_p using locally dense lattices. We construct such lattices simply by applying "Construction A" to Reed-Solomon codes with suitable parameters, and prove their local density via an elementary argument originally used in the context of Craig lattices. As in all known -hardness results for _p with p < ∞, our reduction uses randomness. Indeed, it is a notorious open problem to prove -hardness via a deterministic reduction. To this end, we additionally discuss potential directions and associated challenges for derandomizing our reduction. In particular, we show that a close deterministic analogue of our local density construction would improve on the state-of-the-art explicit Reed-Solomon list-decoding lower bounds of Guruswami and Rudra (STOC 2005 and IEEE Trans. Inf. Theory 2006). As a related contribution of independent interest, we also give a polynomial-time algorithm for decoding n-dimensional "Construction A Reed-Solomon lattices" (with different parameters than those used in our hardness proof) to a distance within an O(√(log n)) factor of Minkowski's bound. This asymptotically matches the best known distance for decoding near Minkowski's bound, due to Mook and Peikert (IEEE Trans. Inf. Theory 2022), whose work we build on with a somewhat simpler construction and analysis.
READ FULL TEXT