A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices

DOI10.1007/978-3-642-23178-0_40zbMath1335.94069OpenAlexW65754961MaRDI QIDQ3100319

Michael Schneider, Benjamin Milde

Publication date: 23 November 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

parallelizationmulticore CPUGaussSieveShortest Vector Problem (SVP)

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10)

Related Items (4)

Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ Gauss Sieve Algorithm on GPUs ⋮ A sieve algorithm based on overlattices

Cites Work

• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
• Sieve algorithms for the shortest vector problem are practical
• Parallel Shortest Lattice Vector Enumeration on Graphics Cards
• Lattice Enumeration Using Extreme Pruning
• Accelerating Lattice Reduction with FPGAs
• On the equidistribution of Hecke points
• A sieve algorithm for the shortest lattice vector problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices