Lattice Sparsification and the Approximate Closest Vector Problem

DOI10.1137/1.9781611973105.78zbMath1421.68207OpenAlexW2949864582MaRDI QIDQ5741786

Daniel Dadush, Gábor Kun

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/24656

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06) Approximation algorithms (68W25)

Related Items (1)

Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE

This page was built for publication: Lattice Sparsification and the Approximate Closest Vector Problem