Date of Award

12-2026

Document Type

Thesis

Degree Name

Master of Arts in Mathematics

Department

Mathematics

First Reader/Committee Chair

Youngsu Kim

Abstract

This thesis examines the mathematical foundations of lattice based cryptography, with a focus on Goldreich--Goldwasser--Halevi (GGH) and ``Number Theorists R Us" (NTRU). Fundamental concepts of lattice theory such as lattice bases, lattice reduction, Shortest Vector Problem (SVP), and Closest Vector Problem (CVP) are introduced. Algorithms discussed are Gaussian's Lattice Reduction, Lenstra--Lenstra--Lovász (LLL), and Babai's algorithm for CVP. With these foundations, we demonstrate the construction, encryption, and decryption procedures of GGH and NTRU. Mathematical examples and supporting SageMath experiments illustrate the behavior of these two cryptosystems. Specifically, we look into the effect of lattice basis selection for lattice recovery in GGH and the influence of moduli selection in decryption success in NTRU. The results of these experiments highlight the role of lattice geometry, algorithms, and parameter selection in lattice cryptography.

Share

COinS