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...
Main Authors: | Li, Zhe, Ling, San, Xing, Chaoping, Yeo, Sze Ling |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138650 |
Similar Items
-
On Advances of Lattice-Based Cryptographic Schemes and Their Implementations
by: Harshana Bandara, et al.
Published: (2022-11-01) -
Constructions and bounds on linear error-block codes
by: Ling, San, et al.
Published: (2013) -
Cryptanalysis of lightweight symmetric-key cryptographic algorithms
by: Tan, Quan Quan
Published: (2024) -
Analysis of cryptographic hash functions
by: Guo, Jian
Published: (2011) -
On the variance of average distance of subsets in the Hamming space
by: Fu, Fang-Wei, et al.
Published: (2013)