Publication Date
8-2024
Date of Final Oral Examination (Defense)
6-24-2024
Type of Culminating Activity
Thesis
Degree Title
Master of Science in Mathematics
Department Filter
Mathematics
Department
Mathematics
Supervisory Committee Chair
Liljana Babinkostova, Ph.D.
Supervisory Committee Member
Jens Harlander, Ph.D.
Supervisory Committee Member
Marion Scheepers, Ph.D.
Abstract
Much of modern day cryptography deals with the notion of security and efficiency. The main concern with any cryptosystem deals with the practicality of being able to implement any encryption algorithm over large data sets. In this paper, we will look at the various properties of the Learning With Rounding problem (LWR) which comes from the Learning With Errors problem (LWE) first introduced by Oded Regev. We will also present the topic of Homomorphic Encryption (HE) as well as its three variants: Partially Homomorphic Encryption (PHE), Somewhat Homomorphic Encryption (SHE), and Fully Homomorphic Encryption (FHE). This paper also highlights SABER, a cryptographic system based on LWR. The purpose of this paper is to investigate the implications of a Homomorphic Encryption scheme based on LWR that may lead to further research on the topic.
DOI
https://doi.org/10.18122/td.2247.boisestate
Recommended Citation
Montoya, Jose Manuel, "A Survey on Homomorphic Encryption Based on the Learning with Rounding Problem" (2024). Boise State University Theses and Dissertations. 2247.
https://doi.org/10.18122/td.2247.boisestate
