The hardness of the closest vector problem with preprocessing

IEEE Transactions on Information Theory

Volumn 47, Issue 3, 2001, Pages 1212-1215

  Micciancio, D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Closest vector problem; Computational complexity; Cryptography; NP hardness; Point lattices; Polynomial hierarchy; Subset sum (SS)

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); MATRIX ALGEBRA; POLYNOMIALS;

CLOSEST VECTOR PROBLEM; NP-HARDNESS; POLYNOMIAL HIERARCHY; SUBSET SUM;

CRYPTOGRAPHY;

EID: 0035271103     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.915688     Document Type: Letter

References (27)