Degree Granting Department
Mathematics and Statistics
Dickson polynomial, Finite field, Normal basis, Permutation polynomial, Reversed Dickson polynomial
Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigmaa isin Fq (x+a)n = gn,q(xq- x) gives rise to many permutation polynomials over finite fields. We are interested in triples (n,e;q) for which gn,q is a permutation polynomial of Fqe. In Chapters 2, 3, and 4 of this dissertation, we present many new families of permutation polynomials in the form of gn,q. The permutation behavior of gn,q is becoming increasingly more interesting and challenging. As we further explore the permutation behavior of gn,q, there is a clear indication that gn,q is a plenteous source of permutation polynomials.
We also describe a piecewise construction of permutation polynomials over a finite field Fq which uses a subgroup of Fq*, a “selection” function, and several “case” functions. Chapter 5 of this dissertation is devoted to this piecewise construction which generalizes several recently discovered families of permutation polynomials.
Scholar Commons Citation
Fernando, Neranga, "A Study of Permutation Polynomials over Finite Fields" (2013). USF Tampa Graduate Theses and Dissertations.