Related papers: New Classes of Permutation Binomials and Permutati…
Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of…
Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…
In this paper, the compositional inverses of a class of linearized permutation polynomials of the form $P(x)=x+x^2+\tr(\frac{x}{a})$ over the finite field $\mathbb{F}_{2^n}$ for an odd positive integer $n$ are explicitly determined.
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
Recently, a new concept called the $c$-differential uniformity was proposed by Ellingsen et al. (2020), which allows to simplify some types of differential cryptanalysis. Since then, finding functions having low $c$-differential uniformity…
Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper we generalize and improve several well-known results, which were studied over finite fields $\mathbb{F}_q$ and finite cyclic rings $\mathbb{Z}/p^r\mathbb{Z}$, in the…
The aim of this paper is to investigate generating functions for modification of the Milne-Thomson's polynomials, which are related to the Bernoulli polynomials and the Hermite polynomials. By applying the Umbral algebra to these generating…
Let $q>2$ be a prime power and $f=-{\tt x}+t{\tt x}^q+{\tt x}^{2q-1}$, where $t\in\Bbb F_q^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q$ is even and…
We present several existence and nonexistence results for permutation binomials of the form $x^r(x^{q-1}+a)$, where $e\geq 2$ and $a\in \mathbb{F}_{q^e}^*$. As a consequence, we obtain a complete characterization of such permutation…
We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…
It is shown that there exists a duality among fields. If a field is dual to another field, the solution of the field can be obtained from the dual field by the duality transformation. We give a general result on the dual fields. Different…
We study compositional inverses of permutation polynomials, complete mappings, mutually orthogonal Latin squares, and bent vectorial functions. Recently it was obtained in [33] the compositional inverses of linearized permutation binomials…
We consider the problem of enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over binary field extensions. Moreover we give a general search algorithm for primitive…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…
The cohomology of the degree-$n$ general linear group over a finite field of characteristic $p$, with coefficients also in characteristic $p$, remains poorly understood. For example, the lowest degree previously known to contain nontrivial…
We introduce a multivariate analogue of Bernoulli polynomials and give their fundamental properties: difference and differential relations, symmetry, explicit formula, inversion formula, multiplication theorem, and binomial type formula.…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
The class of self-conjugate-reciprocal irreducible monic (SCRIM) polynomials over finite fields are studied. Necessary and sufficient conditions for monic irreducible polynomials to be SCRIM are given. The number of SCRIM polynomials of a…