Sieve, Enumerate, Slice, and Lift:

DOI10.1007/978-3-030-51938-4_15OpenAlexW3029035689MaRDI QIDQ5048976

Benne de Weger, Thijs Laarhoven, Emmanouil Doulgerakis

Publication date: 9 November 2022

Published in: Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51938-4_15

zbMATH Keywords

lattice enumerationclosest vector problem (CVP)lattice sievingshortest vector problem (SVP)randomized slicer

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Exact enumeration problems, generating functions (05A15) Cryptography (94A60)

Related Items (2)

Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Lower bounds on lattice sieving and information set decoding

Uses Software

• BKZ
• fpLLL
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• BKZ
• On Lovász' lattice reduction and the nearest lattice point problem
• A hierarchy of polynomial time lattice basis reduction algorithms
• Progressive lattice sieving
• Shortest vector from lattice sieving: a few dimensions for free
• Sieving for closest lattice vectors (with preprocessing)
• Speed-ups and time-memory trade-offs for tuple lattice sieving
• The general sieve kernel and new records in lattice reduction
• Finding closest lattice vectors using approximate Voronoi cells
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
• Solving the Shortest Vector Problem in 2 ⁿ Time Using Discrete Gaussian Sampling
• Tuple lattice sieving
• Algorithms for the Shortest and Closest Lattice Vector Problems
• BKZ 2.0: Better Lattice Security Estimates
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• 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
• Finding the Closest Lattice Point by Iterative Slicing
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• New directions in nearest neighbor searching with applications to lattice sieving
• A sieve algorithm for the shortest lattice vector problem
• Fast Lattice Point Enumeration with Minimal Overhead
• Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
• Random Sampling Revisited: Lattice Enumeration with Discrete Pruning

This page was built for publication: Sieve, Enumerate, Slice, and Lift: