Bibliographic Details
| Title: |
On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications. |
| Authors: |
Li, Zhe, Ling, San, Xing, Chaoping, Yeo, Sze Ling |
| Source: |
IEEE Transactions on Information Theory; Apr2020, Vol. 66 Issue 4, p2588-2598, 11p |
| Subject Terms: |
DISTANCES, POLYNOMIALS |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science