Improved lower bound for the complexity of unique shortest vector problem

被引：0
作者：
Baolong Jin
Rui Xue
机构：
[1] Chinese Academy of Sciences,State Key Laboratory of Information Security, Institute of Information Engineering
[2] University of Chinese Academy of Sciences,School of Cyber Security
来源：
Cybersecurity | / 6卷
关键词：
Computational complexity; Unique shortest vector problem; Bounded distance decoding; Complexity reduction;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 13 条
  • [1] Aggarwal D(2016)Improved hardness results for unique shortest vector problem Inf Process Lett 116 631-637
  • [2] Dubey CK(1998)A relation of primal-dual lattices and the complexity of shortest lattice vector problem Theor Comput Sci 207 105-116
  • [3] Cai J(1999)A lattice-based public-key cryptosystem Inf Comput 151 17-31
  • [4] Cai J(2000)On the limits of nonapproximability of lattice problems J Comput Syst Sci 60 540-563
  • [5] Cusick TW(2001)On the unique shortest lattice vector problem Theor Comput Sci 255 641-648
  • [6] Goldreich O(2004)Almost perfect lattices, the covering radius problem, and applications to ajtai’s connection factor SIAM J Comput 34 118-169
  • [7] Goldwasser S(2012)Inapproximability of the shortest vector problem: toward a deterministic reduction Theory Comput 8 487-512
  • [8] Kumar R(1972)On the density of families of sets J Comb Theory Ser A 13 145-147
  • [9] Sivakumar D(1972)A combinatorial problem; stability and order for models and theories in infinitary languages Pac J Math 41 247-261
  • [10] Micciancio D(undefined)undefined undefined undefined undefined-undefined
12