Welcome to the resource topic for 2021/1295
Title:
Improved Quantum Hypercone Locality Sensitive Filtering in Lattice Sieving
Authors: Max Heiser
Abstract:The asymptotically fastest known method for solving SVP is via lattice sieving, an algorithm whose computational bottleneck is solving the Nearest Neighbor Search problem. The best known algorithm for solving this problem is Hypercone Locality Sensitive Filtering (LSF). The classical time complexity of a sieve using Hypercone LSF is (2^{0.2925d+o(d)}). The quantum time complexity is (2^{0.2653d+o(d)}), which is acquired by using Grover’s algorithm to speed up part of the enumeration. We present an improvement to the quantum algorithm, which improves the time complexity to (2^{0.2571d+o(d)}). Essentially, we provide a way to use Grover’s algorithm to speed up another part of the process, providing a better tradeoff. This improvement affects the security of lattice-based encryption schemes, including NIST PQC Round 3 finalists.
ePrint: https://eprint.iacr.org/2021/1295
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .