A three-level sieve algorithm for the shortest vector problem

DOI10.1007/978-3-662-43414-7_2MaRDI QIDQ2949521zbMATH OpenOpenAlexFDO

Authors Feng Zhang, Yanbin Pan, G. 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

latticesphere coveringshortest vector problemsieve algorithm

Mathematics Subject Classification ID

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

Recommendations

• A sieve algorithm based on overlattices
• A sieve algorithm for the shortest lattice vector problem
• Shortest vector from lattice sieving: a few dimensions for free
• A new lattice sieving algorithm base on angular locality-sensitive hashing
• Sieve algorithms for the shortest vector problem are practical

Cited in

(12)

• Finding shortest lattice vectors faster using quantum search
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• scientific article; zbMATH DE number 1852132 (Why is no real title available?)
• Sieving for closest lattice vectors (with preprocessing)
• Lattice Sieving via Quantum Random Walks
• Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
• Finding shortest lattice vectors in the presence of gaps
• Sieve algorithms for some orthogonal integer lattices
• BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
• CryptAttackTester: high-assurance attack analysis
• A sieve algorithm based on overlattices
• Finding shortest vector using quantum NV sieve on Grover

This page was built for publication: A three-level sieve algorithm for the shortest vector problem

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