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: | , , , |
---|---|
Other Authors: | |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138650 |