ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2105.05608
34
35

Lattice sieving via quantum random walks

12 May 2021
André Chailloux
Johanna Loyer
ArXiv (abs)PDFHTML
Abstract

Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) is arguably the most important problem for the cryptanalysis of lattice-based cryptography, and many lattice-based schemes have security claims based on its hardness. The best quantum algorithm for the SVP is due to Laarhoven [Laa16 PhD] and runs in (heuristic) time 20.2653d+o(d)2^{0.2653d + o(d)}20.2653d+o(d). In this article, we present an improvement over Laarhoven's result and present an algorithm that has a (heuristic) running time of 20.2570d+o(d)2^{0.2570 d + o(d)}20.2570d+o(d) where ddd is the lattice dimension. We also present time-memory trade-offs where we quantify the amount of quantum memory and quantum random access memory of our algorithm. The core idea is to replace Grover's algorithm used in [Laa16 PhD] in a key part of the sieving algorithm by a quantum random walk in which we add a layer of local sensitive filtering.

View on arXiv
Comments on this paper