On the bounded distance decoding problem for lattices constructed and their cryptographic applications

On the bounded distance decoding problem for lattices constructed and their cryptographic applications

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Zhe, Ling, San, Xing, Chaoping, Yeo, Sze Ling
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2020
Subjects:
Science::Mathematics::Discrete mathematics::Cryptography
Trapdoor Function
Closest Vector Problem
Online Access:https://hdl.handle.net/10356/138650
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-138650
record_format dspace
spelling sg-ntu-dr.10356-1386502023-02-28T19:51:56Z On the bounded distance decoding problem for lattices constructed and their cryptographic applications Li, Zhe Ling, San Xing, Chaoping Yeo, Sze Ling School of Physical and Mathematical Sciences Science::Mathematics::Discrete mathematics::Cryptography Trapdoor Function Closest Vector Problem 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. MOE (Min. of Education, S’pore) Accepted version 2020-05-11T06:50:19Z 2020-05-11T06:50:19Z 2020 Journal Article 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 0018-9448 https://hdl.handle.net/10356/138650 10.1109/TIT.2020.2967047 4 66 2588 2598 en MOE2016-T2-2-014(S) RG21/18 IEEE Transactions on Information Theory © 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 application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Science::Mathematics::Discrete mathematics::Cryptography
Trapdoor Function
Closest Vector Problem
spellingShingle Science::Mathematics::Discrete mathematics::Cryptography
Trapdoor Function
Closest Vector Problem
Li, Zhe
Ling, San
Xing, Chaoping
Yeo, Sze Ling
On the bounded distance decoding problem for lattices constructed and their cryptographic applications
description 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.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Li, Zhe
Ling, San
Xing, Chaoping
Yeo, Sze Ling
format Article
author Li, Zhe
Ling, San
Xing, Chaoping
Yeo, Sze Ling
author_sort Li, Zhe
title On the bounded distance decoding problem for lattices constructed and their cryptographic applications
title_short On the bounded distance decoding problem for lattices constructed and their cryptographic applications
title_full On the bounded distance decoding problem for lattices constructed and their cryptographic applications
title_fullStr On the bounded distance decoding problem for lattices constructed and their cryptographic applications
title_full_unstemmed On the bounded distance decoding problem for lattices constructed and their cryptographic applications
title_sort on the bounded distance decoding problem for lattices constructed and their cryptographic applications
publishDate 2020
url https://hdl.handle.net/10356/138650
_version_ 1759857534888312832

Similar Items