A Three-Level Sieve Algorithm for the Shortest Vector Problem

DOI10.1007/978-3-662-43414-7_2zbMath1321.94098OpenAlexW998470930MaRDI QIDQ2949521

Yanbin Pan, Feng Zhang, Gengran Hu

Publication date: 1 October 2015

Published in: Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43414-7_2

zbMATH Keywords

latticeshortest vector problemsphere coveringsieve algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (6)

Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Lattice Sieving via Quantum Random Walks ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps

This page was built for publication: A Three-Level Sieve Algorithm for the Shortest Vector Problem