Gauss Sieve Algorithm on GPUs
From MaRDI portal
Publication:2975795
DOI10.1007/978-3-319-52153-4_3zbMath1383.94050OpenAlexW2568095154MaRDI QIDQ2975795
Shang-Yi Yang, Po-Chun Kuo, Bo-Yin Yang, Chen-Mou Cheng
Publication date: 12 April 2017
Published in: Topics in Cryptology – CT-RSA 2017 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-52153-4_3
parallelizationideal latticesGPUlattice-based cryptographySVPsieving algorithmGauss sieveShortest Vector Problem
Related Items (2)
Shortest vector from lattice sieving: a few dimensions for free ⋮ Advanced lattice sieving on GPUs, with tensor cores
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sieving for shortest vectors in ideal lattices: a practical perspective
- Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
- BKZ 2.0: Better Lattice Security Estimates
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- New directions in nearest neighbor searching with applications to lattice sieving
- Candidate Multilinear Maps from Ideal Lattices
- Sieving for Shortest Vectors in Ideal Lattices
- Fully homomorphic encryption using ideal lattices
- A sieve algorithm for the shortest lattice vector problem
- Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice
This page was built for publication: Gauss Sieve Algorithm on GPUs