Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH

DOI10.1007/978-3-319-31517-1_1zbMath1404.94039OpenAlexW2240389964MaRDI QIDQ2814691

Anja Becker, Thijs Laarhoven

Publication date: 22 June 2016

Published in: Progress in Cryptology – AFRICACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31517-1_1

zbMATH Keywords

shortest vector problemlocality-sensitive hashingsieving algorithms(ideal) lattices

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (10)

Lower bounds on lattice sieving and information set decoding ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Lattice Sieving via Quantum Random Walks ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ Estimating quantum speedups for lattice sieves ⋮ Gauss Sieve Algorithm on GPUs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Unnamed Item

This page was built for publication: Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH