On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications.
Uloženo v:
| Název: | On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications. |
|---|---|
| Autoři: | Li, Zhe1 (AUTHOR) lzonline01@gmail.com, Ling, San1 (AUTHOR) lingsan@ntu.edu.sg, Xing, Chaoping1 (AUTHOR) xingcp@ntu.edu.sg, Yeo, Sze Ling2 (AUTHOR) slyeo@i2r.a-star.edu.sg |
| Zdroj: | IEEE Transactions on Information Theory. Apr2020, Vol. 66 Issue 4, p2588-2598. 11p. |
| Témata: | *DISTANCES, *POLYNOMIALS |
| Abstrakt: | 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. [ABSTRACT FROM AUTHOR] |
| Databáze: | Academic Search Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!