On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications

Page view(s)
27
Checked on Jun 11, 2024
On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications
Title:
On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications
Journal Title:
IEEE Transactions on Information Theory
Publication URL:
Publication Date:
01 January 2020
Citation:
Abstract:
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.
License type:
Funding Info:
Description:
ISSN:
0018-9448
Files uploaded:

File Size Format Action
polylattice.pdf 394.61 KB PDF Open