The shortest vector in a lattice is hard to approximate to within some constant.

被引：41
|
作者：
Micciancio, D [1 ]
机构：
[1] MIT, Comp Sci Lab, Cambridge, MA 02139 USA
来源：
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1998年
关键词：
D O I：
10.1109/SFCS.1998.743432
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We show the shortest vector problem in the l(2) norm is NP-hard (for randomized reductions) to approximate within any constant factor less than root 2. We also give a deterministic reduction under a reasonable number theoretic conjecture. Analogous results hold in any l(p) norm (p greater than or equal to 1). In proving our NP-hardness result, we give an alternative construction satisfying Ajtai's probabilistic variant of Sauer's lemma; that greatly simplifies Ajtai's original proof.
引用
收藏
页码：92 / 98
页数：3
相关论文
共 50 条
  • [1] The shortest vector in a lattice is hard to approximate to within some constant
    Micciancio, D
    SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 2008 - 2035
  • [2] Research on Approximate Shortest Lattice Vector Problem with Simultaneous Diophantine Approximation and Hermite Theorem
    Wang, Wen-Bo
    Huang, Qi-Ming
    INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND INFORMATION SECURITY (CNIS 2015), 2015, : 115 - 121
  • [3] A note on the shortest lattice vector problem
    Kumar, R
    Sivakumar, D
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 200 - 204
  • [4] On the unique shortest lattice vector problem
    Kumar, SR
    Sivakumar, D
    THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 641 - 648
  • [5] Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
    Elkin, Michael
    Neiman, Ofer
    2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 128 - 137
  • [6] HOPSETS WITH CONSTANT HOPBOUND, AND APPLICATIONS TO APPROXIMATE SHORTEST PATHS
    Elkin, Michael
    Neiman, Ofer
    SIAM JOURNAL ON COMPUTING, 2019, 48 (04) : 1436 - 1480
  • [7] Explicit Hard Instances of the Shortest Vector Problem
    Buchmann, Johannes
    Lindner, Richard
    Rueckert, Markus
    POST-QUANTUM CRYPTOGRAPHY, PROCEEDINGS, 2008, 5299 : 79 - 94
  • [8] On polynomial approximations to the shortest lattice vector length
    Kumar, R
    Sivakumar, D
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 126 - 127
  • [9] Parallel Shortest Lattice Vector Enumeration on Graphics Cards
    Hermans, Jens
    Schneider, Michael
    Buchmann, Johannes
    Vercauteren, Frederik
    Preneel, Bart
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2010, 2010, 6055 : 52 - +
  • [10] The Analysis of the Extended Search Space for the Shortest Vector in Lattice
    Fukase, Masaharu
    Yamaguchi, Kazunori
    IMETI 2010: 3RD INTERNATIONAL MULTI-CONFERENCE ON ENGINEERING AND TECHNOLOGICAL INNOVATION, VOL II (POST-CONFERENCE EDITION), 2010, : 209 - 213
12345