An Extensive Study on Lattice-Based Cryptography and its Applications for RLWE-Based Problems

Sonam Yadav

doi:10.36676/urr.2023-v10i3-014

Authors

Yadav S Department of Mathematics, Shree Guru Gobind Singh Tricentenary University, Gurugram, Haryana

DOI:

https://doi.org/10.36676/urr.2023-v10i3-014

Keywords:

Cryptography

Abstract

Lattice-based cryptography has emerged as a powerful paradigm for constructing secure cryptographic primitives, offering resistance to quantum attacks and providing a versatile framework for building post-quantum cryptographic systems. This research paper provides an in-depth exploration of lattice-based cryptography, focusing specifically on its applications for problems based on Ring Learning with Errors (RLWE). We analyze the fundamental concepts of lattice theory, delve into the RLWE problem, and highlight the security properties and challenges associated with lattice-based schemes. Furthermore, we discuss various real-world applications of lattice-based cryptography, demonstrating its potential for secure communication, privacy-preserving protocols, and post-quantum cryptography.

References

B. Applebaum, D. Cash, C. Peikert, and A. Sahai. Fast cryptographic primitives and circularsecure encryption based on hard learning problems. In CRYPTO, 595–618. 2009.

L. Babai. On Lovasz lattice reduction and the nearest lattice point problem. Combinatorica, 6(1):1–13, 1986. Preliminary version in STACS 1985.

Z. Brakerski, C. Gentry, and V. Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. In ICTS, 309–325. 2012.

Bar-Ilan Univ. Winter School on Lattice-Based Cryptography and Applications. 2012.

P. Campbell, M. Groves, and D. Shepherd. Soliloquy: A Cautionary Tale, 2014. http://docbox.etsi.org/Workshop/2014/201410_CRYPTO/S07_Systems_and_ Attacks/S07_Groves_Annex.pdf.

K. Conrad. The Different Ideal. http://www.math.uconn.edu/~kconrad/blurbs/gradnumthy/different.pdf.

R. Cramer, L. Ducas, C. Peikert, O. Regev. Recovering Short Generators of Principal Ideals in Cyclotomic Rings, 2015. https://eprint.iacr.org/2015/313.pdf

J. Ding and Richard Lindner. Identifying Ideal Lattices, 2007. https://eprint.iacr.org/2007/322

C. Gentry, C. Peikert, and V. Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In STOC, pages 197–206. 2008.

Yupu Hu and Huiwen Jia. Cryptanalysis of GGH Map, 2015. https://eprint.iacr.org/2015/301.pdf.

V. Lyubashevsky, C. Peikert, and O. Regev. On ideal lattices and learning with errors over rings. J. ACM, 2013. To appear. Preliminary version in Eurocrypt 2010.

Vadim Lyubashevsky, Chris Peikert, and Oded Regev. A toolkit for ring-LWE cryptography. In EUROCRYPT, 35–54. 2013.