Gauss sieve algorithm on GPUs

DOI10.1007/978-3-319-52153-4_3MaRDI QIDQ2975795zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Gauss sieveGPUideal latticeslattice-based cryptographyparallelizationShortest Vector Problemsieving algorithmSVP

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Tuning GaussSieve for speed
• Analysis of Gauss-sieve for solving the shortest vector problem in lattices
• Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
• A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
• Advanced lattice sieving on GPUs, with tensor cores

Cites work

• A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
• A sieve algorithm for the shortest lattice vector problem
• Analysis of Gauss-sieve for solving the shortest vector problem in lattices
• Better key sizes (and attacks) for LWE-based encryption
• BKZ 2.0: Better lattice security estimates
• Candidate Multilinear Maps from Ideal Lattices
• Efficient (ideal) lattice sieving using cross-polytope LSH
• Faster exponential time algorithms for the shortest vector problem
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 813748 (Why is no real title available?)
• Lattice enumeration using extreme pruning
• New directions in nearest neighbor searching with applications to lattice sieving
• Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
• Sieve algorithms for the shortest vector problem are practical
• Sieving for shortest vectors in ideal lattices
• Sieving for shortest vectors in ideal lattices: a practical perspective
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing

Cited in

(11)

• Sieving for shortest vectors in ideal lattices: a practical perspective
• Shortest vector from lattice sieving: a few dimensions for free
• Advanced lattice sieving on GPUs, with tensor cores
• The general sieve kernel and new records in lattice reduction
• On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA
• Tuning GaussSieve for speed
• Analysis of Gauss-sieve for solving the shortest vector problem in lattices
• Sieving for shortest vectors in ideal lattices
• Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• Towards large-scale lattice attack: new lattice records by disk-based sieving

Describes a project that uses

Uses Software

• CUDA
• BKZ

This page was built for publication: Gauss sieve algorithm on GPUs

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