Permutation polynomials $${x^{{2^{k + 1}} + 3}} + a{x^{{2^k} + 2}} + bx$$ over $${F_{{2^{2k}}}}$$ and their differential uniformity
نویسندگان
چکیده
منابع مشابه
Permutation polynomials and their differential properties over residue class rings
This paper mainly focuses on permutation polynomials over the residue class ring ZN , where N > 3 is composite. We have proved that for the polynomial f(x) = a1x 1 + · · · + akx with integral coefficients, f(x) mod N permutes ZN if and only if f(x) mod N permutes Sμ for all μ | N , where Sμ = {0 < t < N : gcd(N, t) = μ} and SN = S0 = {0}. Based on it, we give a lower bound of the differential u...
متن کاملFive Constructions of Permutation Polynomials over $\gf(q^2)$
Four recursive constructions of permutation polynomials over GF(q2) with those over GF(q) are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over GF(q2 l ) for any positive integer l with any given permutation polynomial over GF(q). A generic construction of permutation polynomials over GF(22m) with o-polynomial...
متن کاملSpecific permutation polynomials over finite fields
We present new classes of permutation polynomials over finite fields. If q is the order of a finite field, some polynomials are of form xrf(x(q−1)/d), where d|(q − 1). Other permutation polynomials are related with the trace function. 2000 Mathematics Subject Classification: Primary 11T06.
متن کاملSome New Permutation Polynomials over Finite Fields
In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of opolynomials, we obtain a class of permutation polynomials of the form G(x) + γTr(H(x)), where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. C...
متن کاملOn some permutation polynomials over finite fields
Let Fq be a finite field of q = pm elements with characteristic p. A polynomial P(x) ∈ Fq[x] is called a permutation polynomial of Fq if P(x) induces a bijective map from Fq to itself. In general, finding classes of permutation polynomials of Fq is a difficult problem (see [3, Chapter 7] for a survey of some known classes). An important class of permutation polynomials consists of permutation p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2020
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-018-9741-6