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 条
  • [31] Attack on lattice shortest vector problem using K-Nearest Neighbour
    Shaurya Pratap Singh
    Brijesh Kumar Chaurasia
    Tanmay Tripathi
    Ayush Pal
    Siddharth Gupta
    Iran Journal of Computer Science, 2024, 7 (3) : 515 - 531
  • [32] A relation of primal-dual lattices and the complexity of shortest lattice vector problem
    Cai, JY
    THEORETICAL COMPUTER SCIENCE, 1998, 207 (01) : 105 - 116
  • [33] Vertex cover might be hard to approximate to within 2-ε
    Khot, S
    Regev, O
    18TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2003, : 379 - 386
  • [34] Clique is hard to approximate within n(1-epsilon)
    Hastad, J
    37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 627 - 636
  • [35] Vertex cover might be hard to approximate to within 2-ε
    Khot, Subhash
    Regev, Oded
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (03) : 335 - 349
  • [36] LATTICE-CONSTANT SYSTEMS AND SOME OF THEIR PROPERTIES
    CHEN, HH
    LEE, F
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1984, 17 (11): : 2225 - 2232
  • [37] Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem
    Li, Xiulan
    Pan, Yanbin
    Tian, Chengliang
    INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2021, 2021, 13107 : 223 - 241
  • [38] LTSC-128: Stream cipher based on the intractable Shortest Vector Problem in Lattice
    Suwais, Khaled
    Samsudin, Azman
    Journal of Digital Information Management, 2011, 9 (01): : 27 - 32
  • [39] Clique is hard to approximate within n1-o(1)
    Engebretsen, L
    Holmerin, J
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 2 - 12
  • [40] SOME CONSEQUENCES OF APPROXIMATE RECURSION RELATIONS IN LATTICE GAUGE THEORIES
    SARKAR, S
    PHYSICAL REVIEW D, 1977, 16 (08): : 2666 - 2667
12345