{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-3808"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-3808","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"Lattice-Based Cryptography: A Comparative Study of GGH and NTRU","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.","abstract_html":"This thesis examines the mathematical foundations of lattice based cryptography, with a focus on Goldreich--Goldwasser--Halevi (GGH) and ``Number Theorists R Us&quot; (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&#x27;s Lattice Reduction, Lenstra--Lenstra--Lovász (LLL), and Babai&#x27;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.","abstract_has_math":false,"creators":["Morales, Brenda"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Youngsu Kim"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-21T09:14:54Z","subjects":["Lattice-Based Cryptography","Post-Quantum Cryptography","GGH Cryptosystem","NTRU Cryptosystem","Lattice Reduction","Closest Vector Problem","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd/2551","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd/2551","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-3808","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Youngsu Kim"]},{"key":"dc:creator","label":"Author","values":["Morales, Brenda"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2026-11-09T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2026-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Lattice-Based Cryptography","Post-Quantum Cryptography","GGH Cryptosystem","NTRU Cryptosystem","Lattice Reduction","Closest Vector Problem","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd/2551"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Lattice-Based Cryptography: A Comparative Study of GGH and NTRU"]}]}],"canonical_facts":{"dc:contributor":["Youngsu Kim"],"dc:creator":["Morales, Brenda"],"dc:date.available":["2026-11-09T08:00:00Z"],"dc:date.created":["2026-12-01T08:00:00Z"],"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."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd/2551"],"dc:subject":["Lattice-Based Cryptography","Post-Quantum Cryptography","GGH Cryptosystem","NTRU Cryptosystem","Lattice Reduction","Closest Vector Problem","Other Mathematics"],"dc:title":["Lattice-Based Cryptography: A Comparative Study of GGH and NTRU"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-21T09:14:54Z"}