The hardness of the closest vector problem with preprocessing
From MaRDI portal
Publication:4544560
DOI10.1109/18.915688zbMath1005.68078MaRDI QIDQ4544560
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0efec059f78f4620933ea6f57ca63eec9c6c7ebd
68P25: Data encryption (aspects in computer science)
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Hardness of approximating the closest vector problem with pre-processing, An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm, A polynomial time algorithm for GapCVPP in \(l_1\) norm, The inapproximability of lattice and coding problems with preprocessing, Lattice-based algorithms for number partitioning in the hard phase, Post-Quantum Cryptography: State of the Art, Unnamed Item