Inapproximability results for computational problems on lattices

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

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).

Original languageEnglish (US)
Title of host publicationInformation Security and Cryptography
PublisherSpringer International Publishing
Pages453-473
Number of pages21
DOIs
StatePublished - Jan 1 2010

Publication series

NameInformation Security and Cryptography
Volume10
ISSN (Print)1619-7100
ISSN (Electronic)2197-845X

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Information Systems and Management

Cite this

Khot, S. (2010). Inapproximability results for computational problems on lattices. In Information Security and Cryptography (pp. 453-473). (Information Security and Cryptography; Vol. 10). Springer International Publishing. https://doi.org/10.1007/978-3-642-02295-1_14