The LLL Algorithm

Part of the series Information Security and Cryptography pp 453-473


Inapproximability Results for Computational Problems on Lattices

* Final gross prices may vary according to local VAT.

Get Access


In this article, we present a survey of known inapproximability results for computational problems on lattices, viz. the Shortest Vector Problem (SVP), the Closest Vector Problem (CVP), the Closest Vector Problem with Preprocessing (CVPP), the Covering Radius Problem (CRP), the Shortest Independent Vectors Problem (SIVP), and the Shortest Basis Problem (SBP).