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 条
  • [41] SOME CHARACTERIZATIONS OF THE APPROXIMATE SOLUTIONS TO GENERALIZED VECTOR EQUILIBRIUM PROBLEMS
    Han, Yu
    Huang, Nan-Jing
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2016, 12 (03) : 1135 - 1151
  • [42] A PARAMETRIC VERSION OF LLL AND SOME CONSEQUENCES: PARAMETRIC SHORTEST AND CLOSEST VECTOR PROBLEMS
    Bogart, Tristram
    Goodrick, John
    Woods, Kevin
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (04) : 2363 - 2387
  • [43] Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
    Haviv, Ishay
    Regev, Oded
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 469 - 477
  • [44] Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
    Teruya, Tadanori
    Kashiwabara, Kenji
    Hanaoka, Goichiro
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2018, PT I, 2018, 10769 : 437 - 460
  • [45] Lattice results for the decay constant of heavy-light vector mesons
    Bernard, C
    Williams, P
    Datta, S
    Gottlieb, S
    DeTar, C
    Heller, UM
    McNeile, C
    Orginos, K
    Sugar, R
    Toussaint, D
    PHYSICAL REVIEW D, 2002, 65 (01)
  • [46] Recovering Pulsar Periodicity from Time-of-arrival Data by Finding the Shortest Vector in a Lattice
    Gazith, Dotan
    Pearlman, Aaron B.
    Zackay, Barak
    ASTROPHYSICAL JOURNAL, 2025, 979 (01):
  • [47] Some applications of modular convergence in vector lattice setting
    Boccuto, Antonio
    Sambucini, Anna Rita
    SAMPLING THEORY SIGNAL PROCESSING AND DATA ANALYSIS, 2022, 20 (02):
  • [48] APPROXIMATE SOLUTION OF A SYSTEM OF 3-POINT VECTOR EQUATIONS WITH CONSTANT-COEFFICIENTS
    SHIFMAN, ER
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1992, 32 (09) : 1231 - 1238
  • [49] PHASE-TRANSITIONS IN LATTICE GASES WITH ATTRACTIONS SOME APPROXIMATE RESULTS
    ORBAN, J
    PHYSICA A, 1975, 80 (04): : 379 - 386
  • [50] EFFECT ON DISTRIBUTION OF LATTICE DEFECTS WITHIN CRYSTALS OF LINEAR EXPANSION AND X-RAY LATTICE CONSTANT
    MILLER, PH
    RUSSELL, BR
    JOURNAL OF APPLIED PHYSICS, 1953, 24 (09) : 1248 - 1249
12345