Dual lattice attacks for closest vector problems (with preprocessing)

DOI10.1007/978-3-030-75539-3_20zbMath1479.94204OpenAlexW3160609986MaRDI QIDQ826277

N. E. Zubov

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_20

zbMATH Keywords

lattice-based cryptographybounded distance decoding (BDD)closest vector problem (CVP)lattice algorithmsprimal/dual attacks

Mathematics Subject Classification ID

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

Related Items (1)

Does the dual-sieve attack on learning with errors even work?

Cites Work

• Unnamed Item
• On the concrete hardness of learning with errors
• On Lovász' lattice reduction and the nearest lattice point problem
• A hierarchy of polynomial time lattice basis reduction algorithms
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Shortest vector from lattice sieving: a few dimensions for free
• On the asymptotic complexity of solving LWE
• Sieving for closest lattice vectors (with preprocessing)
• Approximate Voronoi cells for lattices, revisited
• The randomized slicer for CVPP: sharper, faster, smaller, batchier
• Advanced lattice sieving on GPUs, with tensor cores
• CSI-FiSh: efficient isogeny based signatures through class group computations
• Approx-SVP in ideal lattices with pre-processing
• The general sieve kernel and new records in lattice reduction
• Finding closest lattice vectors using approximate Voronoi cells
• Practical, Predictable Lattice Basis Reduction
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• On Bounded Distance Decoding for General Lattices
• Introduction to post-quantum cryptography
• Efficient Public Key Encryption Based on Ideal Lattices
• Minkowski's Convex Body Theorem and Integer Programming
• New directions in nearest neighbor searching with applications to lattice sieving
• IX. On the problem of the most efficient tests of statistical hypotheses
• Sieve, Enumerate, Slice, and Lift:
• Fully homomorphic encryption using ideal lattices
• A sieve algorithm for the shortest lattice vector problem
• Fast Lattice Point Enumeration with Minimal Overhead
• Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Dual lattice attacks for closest vector problems (with preprocessing)