In this paper, we generate algorithms for factoring polynomials with coefficients in finite fields. In particular, we develop one deterministic algorithm due to Elwyn Berlekamp and one probabilistic algorithm due to David Cantor and Hans Zassenhaus. While some authors present versions of the algorithms that can only factor polynomials of a certain form, the algorithms we give are able to factor any polynomial over any finite field. Hence, the algorithms we give are the most general algorithms available for this factorization problem. After formulating the algorithms, we look at various ways they can be applied to more specialized inquiries. For example, we use the algorithms to develop two tests for irreducibility and a process for finding the roots of a polynomial over a finite field. We conclude our work by considering how the Berlekamp and Cantor-Zassenhaus methods can be combined to develop a more efficient factoring process.
","abstract_html":"<p>In this paper, we generate algorithms for factoring polynomials with coefficients in finite fields. In particular, we develop one deterministic algorithm due to Elwyn Berlekamp and one probabilistic algorithm due to David Cantor and Hans Zassenhaus. While some authors present versions of the algorithms that can only factor polynomials of a certain form, the algorithms we give are able to factor any polynomial over any finite field. Hence, the algorithms we give are the most general algorithms available for this factorization problem. After formulating the algorithms, we look at various ways they can be applied to more specialized inquiries. For example, we use the algorithms to develop two tests for irreducibility and a process for finding the roots of a polynomial over a finite field. We conclude our work by considering how the Berlekamp and Cantor-Zassenhaus methods can be combined to develop a more efficient factoring process. </p>","abstract_has_math":false,"creators":["Combs, Wade"],"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":2015,"date_issued":"2015-01-01T08:00:00Z","date_published":"2015-01-01T08:00:00Z","updated_at":"2026-07-24T02:15:25Z","subjects":["Berlekamp","Cantor-Zassenhaus","Factoring","Finite Fields","Polynomials","Mathematics"],"languages":[],"rights":["Copyright 2015 Wade Combs"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://encompass.eku.edu/etd/249","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Combs, Wade"]}]},{"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":["Berlekamp","Cantor-Zassenhaus","Factoring","Finite Fields","Polynomials","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Wade Combs"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://encompass.eku.edu/etd/249"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this paper, we generate algorithms for factoring polynomials with coefficients in finite fields. In particular, we develop one deterministic algorithm due to Elwyn Berlekamp and one probabilistic algorithm due to David Cantor and Hans Zassenhaus. While some authors present versions of the algorithms that can only factor polynomials of a certain form, the algorithms we give are able to factor any polynomial over any finite field. Hence, the algorithms we give are the most general algorithms available for this factorization problem. After formulating the algorithms, we look at various ways they can be applied to more specialized inquiries. For example, we use the algorithms to develop two tests for irreducibility and a process for finding the roots of a polynomial over a finite field. We conclude our work by considering how the Berlekamp and Cantor-Zassenhaus methods can be combined to develop a more efficient factoring process.
"]},{"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":["General Factoring Algorithms for Polynomials over Finite Fields"]}]}],"canonical_facts":{"dc:creator":["Combs, Wade"],"dc:description.abstract":["In this paper, we generate algorithms for factoring polynomials with coefficients in finite fields. In particular, we develop one deterministic algorithm due to Elwyn Berlekamp and one probabilistic algorithm due to David Cantor and Hans Zassenhaus. While some authors present versions of the algorithms that can only factor polynomials of a certain form, the algorithms we give are able to factor any polynomial over any finite field. Hence, the algorithms we give are the most general algorithms available for this factorization problem. After formulating the algorithms, we look at various ways they can be applied to more specialized inquiries. For example, we use the algorithms to develop two tests for irreducibility and a process for finding the roots of a polynomial over a finite field. We conclude our work by considering how the Berlekamp and Cantor-Zassenhaus methods can be combined to develop a more efficient factoring process.
"],"dc:format":["application/pdf"],"dc:identifier":["https://encompass.eku.edu/etd/249"],"dc:publisher":["Encompass Digital Archive, Eastern Kentucky University"],"dc:rights":["Copyright 2015 Wade Combs"],"dc:source":["Encompass Digital Archive: Online Theses and Dissertations"],"dc:subject":["Berlekamp","Cantor-Zassenhaus","Factoring","Finite Fields","Polynomials","Mathematics"],"dc:title":["General Factoring Algorithms for Polynomials over Finite Fields"],"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"}