Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/138650
Title: | On the bounded distance decoding problem for lattices constructed and their cryptographic applications | Authors: | Li, Zhe Ling, San Xing, Chaoping Yeo, Sze Ling |
Keywords: | Science::Mathematics::Discrete mathematics::Cryptography | Issue Date: | 2020 | Source: | Li, Z., Ling, S., Xing, C., & Yeo, S. L. (2020). On the bounded distance decoding problem for lattices constructed and their cryptographic applications. IEEE Transactions on Information Theory, 66(4), 2588-2598. doi:10.1109/TIT.2020.2967047 | Project: | MOE2016-T2-2-014(S) RG21/18 |
Journal: | IEEE Transactions on Information Theory | 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. | URI: | https://hdl.handle.net/10356/138650 | ISSN: | 0018-9448 | DOI: | 10.1109/TIT.2020.2967047 | Schools: | School of Physical and Mathematical Sciences | Rights: | © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TIT.2020.2967047 | Fulltext Permission: | open | Fulltext Availability: | With Fulltext |
Appears in Collections: | SPMS Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
polylattice.pdf | 394.61 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
50
4
Updated on Mar 18, 2024
Web of ScienceTM
Citations
50
3
Updated on Oct 30, 2023
Page view(s)
273
Updated on Mar 18, 2024
Download(s) 50
172
Updated on Mar 18, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.