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
Volume10
DOIs
StatePublished - 2010

Publication series

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

ASJC Scopus subject areas

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

Cite this

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

Inapproximability results for computational problems on lattices. / Khot, Subhash.

Information Security and Cryptography. Vol. 10 Springer International Publishing, 2010. p. 453-473 (Information Security and Cryptography; Vol. 10).

Research output: Chapter in Book/Report/Conference proceedingChapter

Khot, S 2010, Inapproximability results for computational problems on lattices. in Information Security and Cryptography. vol. 10, Information Security and Cryptography, vol. 10, Springer International Publishing, pp. 453-473. https://doi.org/10.1007/978-3-642-02295-1_14
Khot S. Inapproximability results for computational problems on lattices. In Information Security and Cryptography. Vol. 10. Springer International Publishing. 2010. p. 453-473. (Information Security and Cryptography). https://doi.org/10.1007/978-3-642-02295-1_14
Khot, Subhash. / Inapproximability results for computational problems on lattices. Information Security and Cryptography. Vol. 10 Springer International Publishing, 2010. pp. 453-473 (Information Security and Cryptography).
@inbook{7e0f44c403ba4aa9b4e9dde5f7ecf39d,
title = "Inapproximability results for computational problems on lattices",
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).",
author = "Subhash Khot",
year = "2010",
doi = "10.1007/978-3-642-02295-1_14",
language = "English (US)",
volume = "10",
series = "Information Security and Cryptography",
publisher = "Springer International Publishing",
pages = "453--473",
booktitle = "Information Security and Cryptography",

}

TY - CHAP

T1 - Inapproximability results for computational problems on lattices

AU - Khot, Subhash

PY - 2010

Y1 - 2010

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

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

UR - http://www.scopus.com/inward/record.url?scp=85016192576&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85016192576&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02295-1_14

DO - 10.1007/978-3-642-02295-1_14

M3 - Chapter

AN - SCOPUS:85016192576

VL - 10

T3 - Information Security and Cryptography

SP - 453

EP - 473

BT - Information Security and Cryptography

PB - Springer International Publishing

ER -