{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-2675"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-2675","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"LATTICE REDUCTION ALGORITHMS","abstract":"The purpose of this thesis is to propose and analyze an algorithm that followssimilar steps of Guassian Lattice Reduction Algorithm in two-dimensions and applyingthem to three-dimensions. We start off by discussing the importance of cryptography inour day to day lives. Then we dive into some linear algebra and discuss specific topics thatwill later help us in understanding lattice reduction algorithms. We discuss two latticeproblems: the shortest vector problem and the closest vector problem. Then we introducetwo types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensionsand the LLL Algortihm. We illustrate how both algorithms can provide solutions to theshortest vector problem and closest vector problem. Afterwards, we use an applicationof a cryptosystem, GGH and show how one could break this cryptosystem using latticereduction algorithms.Finally, we propose and analyze a new algorithm that applies the principles ofGaussian Lattice Reduction Algorithm in two-dimensions. We provide an original proof ofthis algorithm outputting a shortest vector in a given lattice L ∈ R3. We state a conjectureabout the termination of the algorithm. Then we analyze this new algorithm and compareit the LLL Algorithm and Gaussian Lattice reduction Algorithm in two-dimensions. Weprovide examples of different three-dimensional lattices. We then summarize the overallpaper and discuss potential research in the near future.","abstract_html":"The purpose of this thesis is to propose and analyze an algorithm that followssimilar steps of Guassian Lattice Reduction Algorithm in two-dimensions and applyingthem to three-dimensions. We start off by discussing the importance of cryptography inour day to day lives. Then we dive into some linear algebra and discuss specific topics thatwill later help us in understanding lattice reduction algorithms. We discuss two latticeproblems: the shortest vector problem and the closest vector problem. Then we introducetwo types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensionsand the LLL Algortihm. We illustrate how both algorithms can provide solutions to theshortest vector problem and closest vector problem. Afterwards, we use an applicationof a cryptosystem, GGH and show how one could break this cryptosystem using latticereduction algorithms.Finally, we propose and analyze a new algorithm that applies the principles ofGaussian Lattice Reduction Algorithm in two-dimensions. We provide an original proof ofthis algorithm outputting a shortest vector in a given lattice L ∈ R3. We state a conjectureabout the termination of the algorithm. Then we analyze this new algorithm and compareit the LLL Algorithm and Gaussian Lattice reduction Algorithm in two-dimensions. Weprovide examples of different three-dimensional lattices. We then summarize the overallpaper and discuss potential research in the near future.","abstract_has_math":false,"creators":["Ortega, Juan"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Meyer, Jeffrey"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:08:27Z","subjects":["bases","lattices","inner product","Gaussian Lattice Reduction in two-dimensions","The LLL Algorithm","the general linear group","Algebra","Algebraic Geometry","Analysis"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd/1436","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd/1436","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-2675","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Meyer, Jeffrey"]},{"key":"dc:creator","label":"Author","values":["Ortega, Juan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2022-04-20T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2022-05-01T07: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":["bases","lattices","inner product","Gaussian Lattice Reduction in two-dimensions","The LLL Algorithm","the general linear group","Algebra","Algebraic Geometry","Analysis"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd/1436"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The purpose of this thesis is to propose and analyze an algorithm that followssimilar steps of Guassian Lattice Reduction Algorithm in two-dimensions and applyingthem to three-dimensions. We start off by discussing the importance of cryptography inour day to day lives. Then we dive into some linear algebra and discuss specific topics thatwill later help us in understanding lattice reduction algorithms. We discuss two latticeproblems: the shortest vector problem and the closest vector problem. Then we introducetwo types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensionsand the LLL Algortihm. We illustrate how both algorithms can provide solutions to theshortest vector problem and closest vector problem. Afterwards, we use an applicationof a cryptosystem, GGH and show how one could break this cryptosystem using latticereduction algorithms.Finally, we propose and analyze a new algorithm that applies the principles ofGaussian Lattice Reduction Algorithm in two-dimensions. We provide an original proof ofthis algorithm outputting a shortest vector in a given lattice L ∈ R3. We state a conjectureabout the termination of the algorithm. Then we analyze this new algorithm and compareit the LLL Algorithm and Gaussian Lattice reduction Algorithm in two-dimensions. Weprovide examples of different three-dimensional lattices. We then summarize the overallpaper and discuss potential research in the near future."]},{"key":"dc:title","label":"Title","values":["LATTICE REDUCTION ALGORITHMS"]}]}],"canonical_facts":{"dc:contributor":["Meyer, Jeffrey"],"dc:creator":["Ortega, Juan"],"dc:date.available":["2022-04-20T07:00:00Z"],"dc:date.created":["2022-05-01T07:00:00Z"],"dc:description.abstract":["The purpose of this thesis is to propose and analyze an algorithm that followssimilar steps of Guassian Lattice Reduction Algorithm in two-dimensions and applyingthem to three-dimensions. We start off by discussing the importance of cryptography inour day to day lives. Then we dive into some linear algebra and discuss specific topics thatwill later help us in understanding lattice reduction algorithms. We discuss two latticeproblems: the shortest vector problem and the closest vector problem. Then we introducetwo types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensionsand the LLL Algortihm. We illustrate how both algorithms can provide solutions to theshortest vector problem and closest vector problem. Afterwards, we use an applicationof a cryptosystem, GGH and show how one could break this cryptosystem using latticereduction algorithms.Finally, we propose and analyze a new algorithm that applies the principles ofGaussian Lattice Reduction Algorithm in two-dimensions. We provide an original proof ofthis algorithm outputting a shortest vector in a given lattice L ∈ R3. We state a conjectureabout the termination of the algorithm. Then we analyze this new algorithm and compareit the LLL Algorithm and Gaussian Lattice reduction Algorithm in two-dimensions. Weprovide examples of different three-dimensional lattices. We then summarize the overallpaper and discuss potential research in the near future."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd/1436"],"dc:subject":["bases","lattices","inner product","Gaussian Lattice Reduction in two-dimensions","The LLL Algorithm","the general linear group","Algebra","Algebraic Geometry","Analysis"],"dc:title":["LATTICE REDUCTION ALGORITHMS"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-19T08:08:27Z"}