Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice

DOI10.1007/978-3-642-54631-0_24zbMATH Open1335.94054OpenAlexW2216359073MaRDI QIDQ5402985FDOQ5402985

Authors: Tsukasa Ishiguro, Shinsaku Kiyomoto, Yutaka Miyake, 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

Recommendations

• A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
• Gauss sieve algorithm on GPUs
• Sieving for shortest vectors in ideal lattices: a practical perspective
• Tuning GaussSieve for speed
• Efficient (ideal) lattice sieving using cross-polytope LSH

zbMATH Keywords

parallel algorithmideal latticelattice-based cryptographyshortest vector problemGauss sieve algorithm

Mathematics Subject Classification ID

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

Cited In (9)

• Finding shortest lattice vectors faster using quantum search
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
• A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
• A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
• Sieving for closest lattice vectors (with preprocessing)
• Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
• Gauss sieve algorithm on GPUs
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices

This page was built for publication: Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402985)