Sieving for shortest vectors in ideal lattices

DOI10.1007/978-3-642-38553-7_22zbMATH Open1312.94090OpenAlexW118688756MaRDI QIDQ4924696FDOQ4924696

Authors: Michael Schneider 

Publication date: 7 June 2013

Published in: Progress in Cryptology – AFRICACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38553-7_22

Recommendations

• Sieving for shortest vectors in ideal lattices: a practical perspective
• Efficient (ideal) lattice sieving using cross-polytope LSH
• Tuning GaussSieve for speed
• Analysis of Gauss-sieve for solving the shortest vector problem in lattices
• Gauss sieve algorithm on GPUs

zbMATH Keywords

ideal latticesshortest vector problemsieving algorithms

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cited In (24)

• Finding shortest lattice vectors faster using quantum search
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Shortest Integer Vectors
• Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
• Title not available (Why is that?)
• Shortest vector from lattice sieving: a few dimensions for free
• Sieving for closest lattice vectors (with preprocessing)
• Subfield attacks on HSVP in ideal lattices
• Sieving for shortest vectors in ideal lattices: a practical perspective
• Security analysis of cryptosystems using short generators over ideal lattices
• Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
• A local-global approach to solving ideal lattice problems
• On the geometry of cyclic lattices
• Tuning GaussSieve for speed
• Finding shortest lattice vectors in the presence of gaps
• Gauss sieve algorithm on GPUs
• On the ideal shortest vector problem over random rational primes
• BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
• Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
• Analysis of Gauss-sieve for solving the shortest vector problem in lattices
• Efficient (ideal) lattice sieving using cross-polytope LSH
• On the unique shortest lattice vector problem
• Post-quantum key exchange for the Internet and the open quantum safe project
• Random self-reducibility of ideal-SVP via Arakelov random walks

Uses Software

• SageMath

This page was built for publication: Sieving for shortest vectors in ideal lattices

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