Paper 2017/1002
On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications
Zhe Li, San Ling, Chaoping Xing, and Sze Ling Yeo
Abstract
In this paper, we propose new classes of trapdoor functions to solve the bounded distance decoding problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the bounded distance decoding problem is hard to solve unless some trapdoor information is revealed. We thoroughly analyze the security of our proposed functions using state-of-the-art attacks and results on lattice reductions. Finally, we describe how our functions can be used to design quantum-safe encryption schemes with reasonable public key sizes. Our encryption schemes are efficient with respect to key generation, encryption and decryption.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- trapdoor functionCVPlatticepolynomial
- Contact author(s)
- lzonline01 @ gmail com
- History
- 2021-07-26: last of 2 revisions
- 2017-10-13: received
- See all versions
- Short URL
- https://ia.cr/2017/1002
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/1002,
author = {Zhe Li and San Ling and Chaoping Xing and Sze Ling Yeo},
title = {On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/1002},
year = {2017},
url = {https://eprint.iacr.org/2017/1002}
}
