Optimization of search space for finding very short lattice vectors

DOI10.1007/978-3-030-58208-1_9zbMATH Open1471.94021OpenAlexW3081169296MaRDI QIDQ1995508FDOQ1995508

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)

Cited In (1)

• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing

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)