The Hardness of the Closest Vector Problem With Preprocessing Over Norm

Authors:
W. Chen;Jiangtao Meng
Affiliations:
Dept. of Comput. Sci., Nanjing Univ.;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

Efficient lattice-based signature scheme

International Journal of Applied Cryptography
A digital signature scheme based on CV P∞

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

Proceedings of the forty-second ACM symposium on Theory of computing
Note: Inapproximability results for the minimum integral solution problem with preprocessing over l∞ norm

Theoretical Computer Science

Quantified Score

Hi-index	754.84

Visualization

Abstract

We show that the closest vector problem with preprocessing (CVPP) over lscr infin norm (CVPPinfin) is NP-hard. The result is obtained by the reduction from the subset sum problem with preprocessing to CVPPinfin. The reduction also shows the NP-hardness of CVPinfin, which is much simpler than all previously known proofs. In addition, we also give a direct reduction from exact 3-sets cover problem to CVPPinfin