Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes

Huck Bennett, Chris Peikert. Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. In Nicole Megow, Adam Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. Volume 275 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Abstract

Abstract is missing.