19,990 research outputs found

    Some new results on permutation polynomials over finite fields

    Full text link
    Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-014-4964-2). Furthermore, we give two classes of trinomial permutation polynomials, and make some progress on a conjecture about the differential uniformity of power permutation polynomials proposed by Blondeau et al. (Int. J. Inf. Coding Theory, 2010, 1, pp. 149-170).Comment: 21 pages. We have changed the title of our pape

    Two types of permutation polynomials with special forms

    Full text link
    Let qq be a power of a prime and Fq\mathbb{F}_q be a finite field with qq elements. In this paper, we propose four families of infinite classes of permutation trinomials having the form cxβˆ’xs+xqscx-x^s + x^{qs} over Fq2\mathbb{F}_{q^2}, and investigate the relationship between this type of permutation polynomials with that of the form (xqβˆ’x+Ξ΄)s+cx(x^q-x+\delta)^s+cx. Based on this relation, many classes of permutation trinomials having the form (xqβˆ’x+Ξ΄)s+cx(x^q-x+\delta)^s+cx without restriction on Ξ΄\delta over Fq2\mathbb{F}_{q^2} are derived from known permutation trinomials having the form cxβˆ’xs+xqscx-x^s + x^{qs}

    Further results on complete permutation monomials over finite fields

    Full text link
    In this paper, we construct some new classes of complete permutation monomials with exponent d=qnβˆ’1qβˆ’1d=\frac{q^n-1}{q-1} using AGW criterion (a special case). This proves two recent conjectures in [Wuetal2] and extends some of these recent results to more general nn's

    New results on permutation polynomials over finite fields

    Full text link
    In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms L(x)+βˆ‘j=1kΞ³jhj(fj(x))L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x)) and x+βˆ‘j=1kΞ³jfj(x)x+\sum_{j=1}^k\gamma_jf_j(x). These generalize the results obtained by Kyureghyan in 2011. Consequently, we characterize permutation polynomials of the form L(x)+βˆ‘i=1lΞ³iTrFqm/Fq(hi(x))L(x)+\sum_{i=1} ^l\gamma_i {\rm Tr}_{{\bf F}_{q^m}/{\bf F}_{q}}(h_i(x)), which extends a theorem of Charpin and Kyureghyan obtained in 2009.Comment: 11 pages. To appear in International Journal of Number Theor

    Complete permutation polynomials induced from complete permutations of subfields

    Full text link
    We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to construct complete permutations of certain extension fields with these techniques. The results generalize some recent work of several authors

    New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic

    Full text link
    In this paper, a class of permutation trinomials of Niho type over finite fields with even characteristic is further investigated. New permutation trinomials from Niho exponents are obtained from linear fractional polynomials over finite fields, and it is shown that the presented results are the generalizations of some earlier works

    New Constructions of Permutation Polynomials of the Form xrh(xqβˆ’1)x^rh\left(x^{q-1}\right) over Fq2\mathbb{F}_{q^2}

    Full text link
    Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xrh(xqβˆ’1)x^rh\left(x^{q-1}\right) over Fq2\mathbb{F}_{q^2}, where q=2kq=2^k, h(x)=1+xs+xth(x)=1+x^s+x^t and r,s,t,k>0r, s, t, k>0 are integers. Their methods are essentially usage of a multiplicative version of AGW Criterion because they all transformed the problem of proving permutation polynomials over Fq2\mathbb{F}_{q^2} into that of showing the corresponding fractional polynomials permute a smaller set ΞΌq+1\mu_{q+1}, where ΞΌq+1:={x∈Fq2:xq+1=1}\mu_{q+1}:=\{x\in\mathbb{F}_{q^2} : x^{q+1}=1\}. Motivated by these results, we characterize the permutation polynomials of the form xrh(xqβˆ’1)x^rh\left(x^{q-1}\right) over Fq2\mathbb{F}_{q^2} such that h(x)∈Fq[x]h(x)\in\mathbb{F}_q[x] is arbitrary and qq is also an arbitrary prime power. Using AGW Criterion twice, one is multiplicative and the other is additive, we reduce the problem of proving permutation polynomials over Fq2\mathbb{F}_{q^2} into that of showing permutations over a small subset SS of a proper subfield Fq\mathbb{F}_{q}, which is significantly different from previously known methods. In particular, we demonstrate our method by constructing many new explicit classes of permutation polynomials of the form xrh(xqβˆ’1)x^rh\left(x^{q-1}\right) over Fq2\mathbb{F}_{q^2}. Moreover, we can explain most of the known permutation trinomials, which are in [6, 13, 14, 16, 20, 29], over finite field with even characteristic.Comment: 29 pages. An early version of this paper was presented at Fq13 in Naples, Ital

    New Permutation Trinomials Constructed from Fractional Polynomials

    Full text link
    Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six new classes of permutation trinomials over finite fields of even characteristic are constructed from six fractional polynomials. Further, three classes of permutation trinomials over finite fields of characteristic three are raised. Distinct from most of the known permutation trinomials which are with fixed exponents, our results are some general classes of permutation trinomials with one parameter in the exponents. Finally, we propose a few conjectures

    More new classes of permutation trinomials over F2n\mathbb{F}_{2^n}

    Full text link
    Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over F2n\mathbb{F}_{2^n} which have explicit forms by determining the solutions of some equations.Comment: 17 page

    A new class of permutation trinomials constructed from Niho exponents

    Full text link
    Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial f(x)=x(pβˆ’1)q+1+xpqβˆ’xq+(pβˆ’1)f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)} over the finite field Fq2\mathbb{F}_{q^2}, where pp is an odd prime and q=pkq=p^k with kk being a positive integer. It is shown that when p=3p=3 or 55, f(x)f(x) is a permutation trinomial of Fq2\mathbb{F}_{q^2} if and only if kk is even. This property is also true for more general class of polynomials g(x)=x(q+1)l+(pβˆ’1)q+1+x(q+1)l+pqβˆ’x(q+1)l+q+(pβˆ’1)g(x)=x^{(q+1)l+(p-1)q+1}+x^{(q+1)l+pq}-x^{(q+1)l+q+(p-1)}, where ll is a nonnegative integer and gcd⁑(2l+p,qβˆ’1)=1\gcd(2l+p,q-1)=1. Moreover, we also show that for p=5p=5 the permutation trinomials f(x)f(x) proposed here are new in the sense that they are not multiplicative equivalent to previously known ones of similar form.Comment: 17 pages, three table
    • …
    corecore