Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Some permutations and complete permutation polynomials over finite fields
Date
2019-01-01
Author
Ongan, Pinar
GÜLMEZ TEMÜR, BURCU
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
16
views
0
downloads
Cite This
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.
Subject Keywords
Permutation polynomials
,
Complete permutation polynomials
,
Finite fields
URI
https://hdl.handle.net/11511/66065
Journal
TURKISH JOURNAL OF MATHEMATICS
DOI
https://doi.org/10.3906/mat-1806-83
Collections
Graduate School of Applied Mathematics, Article
Suggestions
OpenMETU
Core
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...
Results on the multiplication in finite fields of characteristic three using modified polynomial representation and normal elements in binary fields
Özel, Canan; Özbudak, Ferruh; Akleylek, Sedat; Department of Cryptography (2013)
In this thesis, we study on the multiplication in finite fields of characteristic three. We use Charlier and Hermite polynomials to represent elements in F_3^n for obtaining alternative representations to the standart polynomial representation. We give multiplication methods in these representations to multiply elements in F_3^n. We compute the multiplication and reduction complexities in each representation and compare the complexity results with the ones in the standart polynomial representation. Charlier...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
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.