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
• التنسيق: مقال
• اللغة: English
• منشور في: 2020
• الموضوعات: Science::Mathematics::Discrete mathematics::Cryptography; Trapdoor Function; Closest Vector Problem
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/138650
• المؤسسة: Nanyang Technological University

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