You are looking at a specific version 20171013:171218 of this paper. See the latest version.

Paper 2017/1002

On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications

Zhe Li and San Ling and Chaoping Xing and Sze Ling Yeo

Abstract

In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector 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. In particular, our scheme can offer around $106$ bits of security with a public key size of around $6.4$ KB. 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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.