Sieving for Shortest Vectors in Ideal Lattices

DOI10.1007/978-3-642-38553-7_22zbMath1312.94090OpenAlexW118688756MaRDI QIDQ4924696

Michael Schneider

Publication date: 7 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38553-7_22

zbMATH Keywords

ideal latticesshortest vector problemsieving algorithms

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ Gauss Sieve Algorithm on GPUs ⋮ On the geometry of cyclic lattices ⋮ Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm

Uses Software

• SageMath

This page was built for publication: Sieving for Shortest Vectors in Ideal Lattices