Abstract
We introduce some new variants of lattice problems: Quadrant-SVP, Quadrant-CVP and Quadrant-GapCVP'. All of them are NP-hard under deterministic reductions from subset sum problem. These new type of lattice problems have potential in construction of cryptosystems. Moreover, these new variant problems have reductions with standard SVP (shortest vector problem) and CVP (closest vector problem), this feature gives new way to study the complexity of SVP and CVP, especially for the proof of NP-hardness of SVP under deterministic reductions, which is an open problem up to now. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Li, W. (2014). New variants of lattice problems and their NP-hardness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8434 LNCS, pp. 511–523). Springer Verlag. https://doi.org/10.1007/978-3-319-06320-1_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
