Optimization of search space for finding very short lattice vectors

DOI10.1007/978-3-030-58208-1_9MaRDI QIDQ1995508zbMATH OpenOpenAlexFDO

Authors Yoshitatsu Matsuda

Publication date 23 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-58208-1_9

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
• BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
• Explicit Hard Instances of the Shortest Vector Problem
• Finding shortest lattice vectors faster using quantum search
• Solving the shortest vector problem in lattices faster using quantum search

Cited in

(3)

• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Application of mixed integer quadratic program to shortest vector problems
• On the SVP for low-dimensional circulant lattices

This page was built for publication: Optimization of search space for finding very short lattice vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995508)