Abstract
A monic irreducible polynomial is known as a normal polynomial if its roots are linearly independent over Galois field. Normal polynomials over finite fields and their significance have been studied quite well. Normal polynomials have applications in different fields such as computer science, number theory, finite geometry, cryptography and coding theory. Several authors have given different algorithms for the construction of normal polynomials. In the present paper, we discuss the construction of the normal polynomials over finite fields of prime characteristic by using the method of composition of polynomials.
Recommended Citation
Gupta, Shalini; Singh, Manpreet; and Sharma, Rozy
(2024).
Construction of Normal Polynomials using Composition of Polynomials over Finite Fields of Odd Characteristic,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 19,
Iss.
3, Article 10.
Available at:
https://digitalcommons.pvamu.edu/aam/vol19/iss3/10