Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

Editor
V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
ISBN:
9780791859742
No. of Pages:
656
Publisher:
ASME Press
Publication date:
2011

The Closest Vector Problem (CVP) is the most intensively studied problem in the algorithmic geometry of numbers. It has been shown by Van and Emde Boas that CVP is NP-hard. There is no known algorithm to approximate CVP within a polynomial factor of the dimension of the lattice. Recently, Koy proposed primal-dual reduction which has better quality than LLL-reduction in high-dimensional lattice. In this paper, an improved algorithm named PNP using Koy's primal-dual reduction is proposed to approximate CVP, which extend from the nearest plane algorithm on LLL bases developed by Babai. The output of PNP algorithm, compared with Babai's, has better approximate factor and PNP algorithm can finish its computing in nearly polynomial time.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal