The Hardness of the Closest Vector Problem With Preprocessing Over$ell_infty$Norm

DOI10.1109/TIT.2006.881835zbMath1323.68296OpenAlexW1981627190MaRDI QIDQ3548137

Wenbin Chen, Jiangtao Meng

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2006.881835

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients ⋮ An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm ⋮ A Digital Signature Scheme Based on CVP  ∞

This page was built for publication: The Hardness of the Closest Vector Problem With Preprocessing Over$ell_infty$Norm