Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice

DOI10.1007/978-3-642-54631-0_24zbMath1335.94054OpenAlexW2216359073MaRDI QIDQ5402985

Shinsaku Kiyomoto, Yutaka Miyake, Tsukasa Ishiguro, Tsuyoshi Takagi

Publication date: 25 March 2014

Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_24

zbMATH Keywords

parallel algorithmideal latticeshortest vector problemlattice-based cryptographyGauss sieve algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (5)

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 ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ Gauss Sieve Algorithm on GPUs

This page was built for publication: Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice