Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search

被引：0
|
作者：
Laarhoven, Thijs [1 ]
Mosca, Michele [2 ,3 ]
van de Pol, Joop [4 ]
机构：
[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] Univ Waterloo, Inst Quantum Comp, Dept C&O, Waterloo, ON N2L 3GL, Canada
[3] Univ Waterloo, Perimeter Inst Theoret Phys, Waterloo, ON N2L 2Y5, Canada
[4] Univ Bristol, Dept Comp Sci, Bristol BS81UB, Avon, England
来源：
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2013 | 2013年 / 7932卷
基金：
英国工程与自然科学研究理事会; 加拿大自然科学与工程研究理事会;
关键词：
lattices; shortest vector problem; sieving; quantum algorithms; quantum search; BASIS REDUCTION; ALGORITHMS; ENUMERATION;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehle, we obtain improved asymptotic quantum results for solving the shortest vector problem. With quantum computers we can provably find a shortest vector in time 2(1.799n+o(n)), improving upon the classical time complexity of 2(2.465n+o(n)) of Pujol and Stehle and the 2(2n+o(n)) of Micciancio and Voulgaris, while heuristically we expect to find a shortest vector in time 2(0.312n+o(n)), improving upon the classical time complexity of 2(0.384n+o(n)) of Wang et al. These quantum complexities will be an important guide for the selection of parameters for post-quantum cryptosystems based on the hardness of the shortest vector problem.
引用
收藏
页码：83 / 101
页数：19
相关论文
共 50 条
  • [1] Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in lp Norm
    Mukhopadhyay, Priyanka
    [J]. ALGORITHMS, 2021, 14 (12)
  • [2] Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
    Schneider, Michael
    [J]. WALCOM: ALGORITHMS AND COMPUTATION, 2011, 6552 : 89 - 97
  • [3] Finding shortest lattice vectors faster using quantum search
    Thijs Laarhoven
    Michele Mosca
    Joop van de Pol
    [J]. Designs, Codes and Cryptography, 2015, 77 : 375 - 400
  • [4] Finding shortest lattice vectors faster using quantum search
    Laarhoven, Thijs
    Mosca, Michele
    van de Pol, Joop
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2015, 77 (2-3) : 375 - 400
  • [5] Techniques for Solving Shortest Vector Problem
    Reddy, V. Dinesh
    Ravi, P.
    Abdul, Ashu
    Morampudi, Mahesh Kumar
    Bojjagani, Sriramulu
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2021, 12 (05) : 841 - 848
  • [6] Hardness of approximating the shortest vector problem in lattices
    Khot, S
    [J]. JOURNAL OF THE ACM, 2005, 52 (05) : 789 - 808
  • [7] The shortest vector problem in lattices with many cycles
    Trolin, W
    [J]. CRYPTOGRAPHY AND LATTICES, 2001, 2146 : 194 - 205
  • [8] Hardness of approximating the shortest vector problem in lattices
    Khot, S
    [J]. 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 126 - 135
  • [9] Faster exponential time algorithms for the shortest vector problem
    Micciancio, Daniele
    Voulgaris, Panagiotis
    [J]. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1468 - 1480
  • [10] A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
    Milde, Benjamin
    Schneider, Michael
    [J]. PARALLEL COMPUTING TECHNOLOGIES, 2011, 6873 : 452 - 458
12345