In mathematics, there are often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard's kangaroo algorithm are two algorithms that attempt to solve discrete logarithm problems. Explanations on what these two algorithms are will be discussed as well as examples of each algorithm. In addition to these two algorithms, a modified form of Pollard's kangaroo algorithm will be provided with results. Throughout the text, Mathematica programs will be presented that simulate each of the three algorithms above.
","abstract_html":"<p>In mathematics, there are often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard's kangaroo algorithm are two algorithms that attempt to solve discrete logarithm problems. Explanations on what these two algorithms are will be discussed as well as examples of each algorithm. In addition to these two algorithms, a modified form of Pollard's kangaroo algorithm will be provided with results. Throughout the text, Mathematica programs will be presented that simulate each of the three algorithms above. </p>","abstract_has_math":false,"creators":["Whaley, Ryan Edward"],"institution":"Eastern Kentucky University","degree_name":"Master of Science (MS)","degree_level":"Master's","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-01-01T08:00:00Z","date_published":"2014-01-01T08:00:00Z","updated_at":"2026-07-24T02:15:25Z","subjects":["Mathematics"],"languages":[],"rights":["Copyright 2014 Ryan Edward Whaley"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://encompass.eku.edu/etd/235","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Whaley, Ryan Edward"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["Encompass Digital Archive, Eastern Kentucky University"]},{"key":"dc:type","label":"Dc Type","values":["Master Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master's"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Eastern Kentucky University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2014 Ryan Edward Whaley"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://encompass.eku.edu/etd/235"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In mathematics, there are often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard's kangaroo algorithm are two algorithms that attempt to solve discrete logarithm problems. Explanations on what these two algorithms are will be discussed as well as examples of each algorithm. In addition to these two algorithms, a modified form of Pollard's kangaroo algorithm will be provided with results. Throughout the text, Mathematica programs will be presented that simulate each of the three algorithms above.
"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:source","label":"Dc Source","values":["Encompass Digital Archive: Online Theses and Dissertations"]},{"key":"dc:title","label":"Title","values":["Algorithms for Solving the Discrete Logarithm Problem"]}]}],"canonical_facts":{"dc:creator":["Whaley, Ryan Edward"],"dc:description.abstract":["In mathematics, there are often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard's kangaroo algorithm are two algorithms that attempt to solve discrete logarithm problems. Explanations on what these two algorithms are will be discussed as well as examples of each algorithm. In addition to these two algorithms, a modified form of Pollard's kangaroo algorithm will be provided with results. Throughout the text, Mathematica programs will be presented that simulate each of the three algorithms above.
"],"dc:format":["application/pdf"],"dc:identifier":["https://encompass.eku.edu/etd/235"],"dc:publisher":["Encompass Digital Archive, Eastern Kentucky University"],"dc:rights":["Copyright 2014 Ryan Edward Whaley"],"dc:source":["Encompass Digital Archive: Online Theses and Dissertations"],"dc:subject":["Mathematics"],"dc:title":["Algorithms for Solving the Discrete Logarithm Problem"],"dc:type":["Master Thesis"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Master's"],"thesis:degree_name":["Master of Science (MS)"],"thesis:institution_name":["Eastern Kentucky University"]},"updated_at":"2026-07-24T02:15:25Z"}