Date of Award
2018
Document Type
Thesis
Department
Natural Sciences
First Advisor
Lepinski, Matthew
Area of Concentration
Mathematics
Abstract
Homomorphic Encryption (HE) aims to make computations on encrypted data with- out decrypting it possible. If it becomes practical, this could spell a paradigm shift in how large private data is used in computations. As of now, there are a few HE schemes that approach practical. This thesis expands the constraints on one such scheme, allowing it to be defined over a larger class of rings, by using a relatively new hardness result. Alongside that, it provides an introduction to HE, the history of HE, and one of these particularly cutting edge schemes. Finally, it discusses the time complexity of multiplying the ring elements used in these schemes.
Recommended Citation
Cohen, Jeremy, "MORE RINGS MORE PROBLEMS: A DISCUSSION OF NUMBER FIELDS FOR HOMOMORPHIC CRYPTOGRAPHY" (2018). Theses & ETDs. 6513.
https://digitalcommons.ncf.edu/theses_etds/6513