Abstract

The approach for constructing the irreducible polynomials of arbitrary degree n over finite fields which is based on the number of the roots over the extension field is presented. At the same time, this paper includes a sample to illustrate the specific construction procedures. Then in terms of the relationship between the order of a polynomial over finite fields and the order of the multiplicative group of the extension field, a method which can determine whether a polynomial over finite fields is irreducible or not is proposed. By applying the Euclidean Algorithm, this judgment can be verified easily.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.