Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The inapproximability of lattice and coding problems with preprocessing
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Hardness of Approximating the Closest Vector Problem with Pre-Processing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lattices that admit logarithmic worst-case to average-case connection factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Radius selection algorithms for sphere decoding
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Identifiability and aliasing in polynomial-phase signals
IEEE Transactions on Signal Processing
A deterministic method for choosing search radii in sphere decoding
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Proceedings of the forty-second ACM symposium on Theory of computing
Frequency estimation by phase unwrapping
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
Adapting density attacks to low-weight knapsacks
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On bounded distance decoding for general lattices
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Theoretical Computer Science
Integer-grid maps for reliable quad meshing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 754.96 |
We give a new simple proof of the NP-hardness of the closest vector problem. In addition to being much simpler than all previously known proofs, the new proof yields new interesting results about the complexity of the closest vector problem with preprocessing. This is a variant of the closest vector problem in which the lattice is specified in advance, and can be preprocessed for an arbitrarily long amount of time before the target vector is revealed. We show that there are lattices for which the closest vector problem remains hard, regardless of the amount of preprocessing