Paper 2020/694
The nearest-colattice algorithm
Thomas Espitau and Paul Kirchner
Abstract
In this work, we exhibit a hierarchy of polynomial time algorithms solving
approximate variants of the Closest Vector Problem (CVP). Our first
contribution is a heuristic algorithm achieving the same distance tradeoff
as HSVP algorithms, namely
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. Algorithmic Number Theory Symposium (ANTS 2020)
- Keywords
- lattice algorithmlattice reduction
- Contact author(s)
- t espitau @ gmail com
- History
- 2020-06-10: received
- Short URL
- https://ia.cr/2020/694
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/694, author = {Thomas Espitau and Paul Kirchner}, title = {The nearest-colattice algorithm}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/694}, year = {2020}, url = {https://eprint.iacr.org/2020/694} }