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...
Saved in:
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: | |
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 |
Similar Items
-
Constructions and bounds on linear error-block codes
by: Ling, San, et al.
Published: (2013) -
EXPONENTIAL TIME/SPACE ALGORITHMS AND REDUCTIONS FOR LATTICE PROBLEMS
by: RAJENDRA KUMAR
Published: (2023) -
Cryptanalysis of lightweight symmetric-key cryptographic algorithms
by: Tan, Quan Quan
Published: (2024) -
Analysis of cryptographic hash functions
by: Guo, Jian
Published: (2011) -
Group signatures with advanced features and lattices
by: Xu, Yanhong
Published: (2019)