Sieving for shortest vectors in ideal lattices: a practical perspective

DOI10.1504/IJACT.2017.089353zbMath1428.94063OpenAlexW3029867009MaRDI QIDQ1626132

Joppe W. Bos, Joop van de Pol, Michael Naehrig

Publication date: 26 November 2018

Published in: International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijact.2017.089353

zbMATH Keywords

ideal latticeslattice cryptanalysisparallel Gauss sievering LWE

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Related Items (6)

Shortest vector from lattice sieving: a few dimensions for free ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ 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 ⋮ Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm

This page was built for publication: Sieving for shortest vectors in ideal lattices: a practical perspective