14,355 research outputs found

    On the inverses of some classes of permutations of finite fields

    Full text link
    We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field, where one of these is a linearized polynomial. In some cases we are able to explicitly obtain these inverses, thus obtaining the compositional inverse of the permutation in question. In addition we show how to compute a linearized polynomial inducing the inverse map over subspaces on which a prescribed linearized polynomial induces a bijection. We also obtain the explicit compositional inverses of two classes of permutation polynomials generalizing those whose compositional inverses were recently obtained in [22] and [24], respectively

    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

    Large classes of permutation polynomials over Fq2\mathbb{F}_{q^2}

    Full text link
    Permutation polynomials (PPs) of the form (xqβˆ’x+c)q2βˆ’13+1+x(x^{q} -x + c)^{\frac{q^2 -1}{3}+1} +x over Fq2\mathbb{F}_{q^2} were presented by Li, Helleseth and Tang [Finite Fields Appl. 22 (2013) 16--23]. More recently, we have constructed PPs of the form (xq+bx+c)q2βˆ’1d+1βˆ’bx(x^{q} +bx + c)^{\frac{q^2 -1}{d}+1} -bx over Fq2\mathbb{F}_{q^2}, where d=2,3,4,6d=2, 3, 4, 6 [Finite Fields Appl. 35 (2015) 215--230]. In this paper we concentrate our efforts on the PPs of more general form f(x)=(axq+bx+c)rΟ•((axq+bx+c)(q2βˆ’1)/d)+uxq+vxΒ Β overΒ Fq2, f(x)=(ax^{q} +bx +c)^r \phi((ax^{q} +bx +c)^{(q^2 -1)/d}) +ux^{q} +vx~~\text{over $\mathbb{F}_{q^2}$}, where a,b,c,u,v∈Fq2a,b,c,u,v \in \mathbb{F}_{q^2}, r∈Z+r \in \mathbb{Z}^{+}, Ο•(x)∈Fq2[x]\phi(x)\in \mathbb{F}_{q^2}[x] and dd is an arbitrary positive divisor of q2βˆ’1q^2-1. The key step is the construction of a commutative diagram with specific properties, which is the basis of the Akbary--Ghioca--Wang (AGW) criterion. By employing the AGW criterion two times, we reduce the problem of determining whether f(x)f(x) permutes Fq2\mathbb{F}_{q^2} to that of verifying whether two more polynomials permute two subsets of Fq2\mathbb{F}_{q^2}. As a consequence, we find a series of simple conditions for f(x)f(x) to be a PP of Fq2\mathbb{F}_{q^2}. These results unify and generalize some known classes of PPs

    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}

    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

    Complete permutation polynomials over finite fields of odd characteristic

    Full text link
    In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.Comment: 13 page

    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 Classes of Permutation Binomials and Permutation Trinomials over Finite Fields

    Full text link
    Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication theory and so on. Permutation binomials and trinomials attract people's interest due to their simple algebraic form and additional extraordinary properties. In this paper, several new classes of permutation binomials and permutation trinomials are constructed. Some of these permutation polynomials are generalizations of known ones.Comment: 18 pages. Submitted to a journal on Aug. 15t

    On constructing complete permutation polynomials over finite fields of even characteristic

    Full text link
    In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials are derived by computing compositional inverses of known ones.Comment: Stupid mistakes in previous versions are correcte

    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
    • …
    corecore