Back to search

CSUniversity San Bernardino

Lattice-Based Cryptography: A Comparative Study of GGH and NTRU

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Arts in Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Morales, Brenda
Contributors dc:contributor
  • Youngsu Kim

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd/2551

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-20
Source record
OAI-PMH GetRecord
citation

Morales, Brenda. Lattice-Based Cryptography: A Comparative Study of GGH and NTRU. Thesis thesis, https://scholarworks.lib.csusb.edu/etd/2551