The randomized slicer for CVPP: sharper, faster, smaller, batchier
From MaRDI portal
Publication:2055682
DOI10.1007/978-3-030-45388-6_1OpenAlexW3021162882MaRDI QIDQ2055682
Thijs Laarhoven, Léo Ducas, Wessel P. J. van Woerden
Publication date: 1 December 2021
Full work available at URL: https://ir.cwi.nl/pub/30000
latticesclosest vector problem with preprocessingapproximate Voronoi cellsgraph-based nearest neighboursiterative slicer
Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)
Related Items
Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Lower bounds on lattice sieving and information set decoding ⋮ On the Security of OSIDH ⋮ The irreducible vectors of a lattice: some theory and applications
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Quantum lattice enumeration and tweaking discrete pruning
- Sieving for closest lattice vectors (with preprocessing)
- Approximate Voronoi cells for lattices, revisited
- The general sieve kernel and new records in lattice reduction
- Finding closest lattice vectors using approximate Voronoi cells
- A Decade of Lattice Cryptography
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- Finding the Closest Lattice Point by Iterative Slicing
- Introduction to post-quantum cryptography
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- New directions in nearest neighbor searching with applications to lattice sieving
- A sieve algorithm for the shortest lattice vector problem
- Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
- 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: The randomized slicer for CVPP: sharper, faster, smaller, batchier
