Some permutations and complete permutation polynomials over finite fields

2019-01-01
Ongan, Pinar
GÜLMEZ TEMÜR, BURCU
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
115
views
0
downloads
In this paper we determine b is an element of F-qn*. for which the polynomial f(x) = x(s+1) + bx is an element of F-qn[x] is a permutation polynomial and determine b is an element of F-gn* for which the polynomial f(x) = x(s+1)+ bx is an element of F(q)n [x] is a complete permutation polynomial where s = q(n)-1/t, t is an element of Z(+) such that t vertical bar q(n) - 1.
Permutation polynomials, Complete permutation polynomials, Finite fields
https://hdl.handle.net/11511/66065
TURKISH JOURNAL OF MATHEMATICS
Graduate School of Applied Mathematics, Article

Suggestions

Permutation polynomials and construction of bent functions
Ongan, Pınar; Doğanaksoy, Ali; Temür, Burcu Gülmez; Department of Cryptography (2021-3-03)
This thesis consists of two main parts: In the first part, a study of several classes ofpermutation and complete permutation polynomials is given, while in the second part,a method of construction of several new classes of bent functions is described.The first part consists of the study of several classes of binomials and trinomialsover finite fields. A complete list of permutation polynomials of the formf(x) =xqn−1q−1+1+bx∈Fqn[x]is obtained for the casen= 5, and a criterion on permutationpol...
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
AKLEYLEK, SEDAT; Cenk, Murat; Özbudak, Ferruh (2010-12-15)
In this paper, we give a new way to represent certain finite fields GF(2(n)). This representation is based on Charlier polynomials. We show that multiplication in Charlier polynomial representation can be performed with subquadratic space complexity. One can obtain binomial or trinomial irreducible polynomials in Charlier polynomial representation which allows us faster modular reduction over binary fields when there is no desirable such low weight irreducible polynomial in other representations. This repre...
On plateaued functions, linear structures and permutation polynomials
Mesnager, Sihem; Kaytancı, Kübra; Özbudak, Ferruh (2019-01-01)
We obtain concrete upper bounds on the algebraic immunity of a class of highly nonlinear plateaued functions without linear structures than the one was given recently in 2017, Cusick. Moreover, we extend Cusick’s class to a much bigger explicit class and we show that our class has better algebraic immunity by an explicit example. We also give a new notion of linear translator, which includes the Frobenius linear translator given in 2018, Cepak, Pasalic and Muratović-Ribić as a special case. We find some app...
On the arithmetic operations over finite fields of characteristic three with low complexity
AKLEYLEK, SEDAT; Özbudak, Ferruh; Özel, Claire Susanna (2014-03-15)
In this paper, the Hermite polynomial representation is adapted as a new way to represent certain finite fields of characteristic three. We give the multiplication method to multiply two elements of F-3n in the Hermite polynomial representation with subquadratic computational complexity by using a divide-and-conquer idea. We show that in some cases there is a set of irreducible binomials in the Hermite polynomial representation to obtain modular reduction with a lower addition complexity than the standard p...
Nonoscillation and asymptotic behaviour for third order nonlinear differential eruptions
Tiryaki, Aydın; Celebi, AO (Institute of Mathematics, Czech Academy of Sciences, 1998-01-01)
In this paper we consider the equation
Citation Formats
P. Ongan and B. GÜLMEZ TEMÜR, “Some permutations and complete permutation polynomials over finite fields,” TURKISH JOURNAL OF MATHEMATICS, pp. 2154–2160, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66065.
METU IIS - Integrated Information Service open@metu.edu.tr