The randomized slicer for CVPP: sharper, faster, smaller, batchier
type: Item
instance of: scholarly article
title: The randomized slicer for CVPP: sharper, faster, smaller, batchier
DOI: 10.1007/978-3-030-45388-6_1
author: Léo Ducas
author: Thijs Laarhoven
author: Wessel P. J. van Woerden
publication date: 2021-12-01T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/30000
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 7436966
zbMATH Keywords: lattices
zbMATH Keywords: closest vector problem with preprocessing
zbMATH Keywords: approximate Voronoi cells
zbMATH Keywords: iterative slicer
zbMATH Keywords: graph-based nearest neighbours
MaRDI profile type: Publication
OpenAlex ID: W3021162882
cites work: A sieve algorithm for the shortest lattice vector problem
cites work: The general sieve kernel and new records in lattice reduction
cites work: Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
cites work: Quantum lattice enumeration and tweaking discrete pruning
cites work: New directions in nearest neighbor searching with applications to lattice sieving
cites work: Introduction to post-quantum cryptography
cites work: Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
cites work: New directions in cryptography
cites work: A note on two problems in connexion with graphs
cites work: Finding closest lattice vectors using approximate Voronoi cells
cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
cites work: Lattice Enumeration Using Extreme Pruning
cites work: Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
cites work: Sieving for closest lattice vectors (with preprocessing)
cites work: Q5115825
cites work: Approximate Voronoi cells for lattices, revisited
cites work: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
cites work: Sieve algorithms for the shortest vector problem are practical
cites work: A decade of lattice cryptography
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Finding the Closest Lattice Point by Iterative Slicing
description: scientific article; zbMATH DE number 7436966