Graduate Defense: Jose Manuel Montoya

Thesis Information

Title: A Survey On Homomorphic Encryption Based On The Learning With Rounding Problem

Program: Master of Science in Mathematics

Advisor: Dr. Liljana Babinkostova, Mathematics

Committee Members: Dr. Marion Scheepers, Mathematics and Dr. Jens Harlander, Mathematics

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 talk I will explore the various properties of the Learning With Rounding problem (LWR) which comes from the Learning With Errors problem (LWE) first introduced by Oded Regev. I 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). A cryptographic system based on LWR, known as SABER, will also be mentioned in this talk.