Related papers: On the Classification of Dillon's APN Hexanomials
A new almost perfect nonlinear function (APN) on the finite field GF(2^10) which is not equivalent to any of the previously known APN mappings is constructed. This is the first example of an APN mapping which is not equivalent to a power…
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…
In a recent work, Beierle, Brinkmann and Leander presented a recursive tree search for finding APN permutations with linear self-equivalences in small dimensions. In this paper, we describe how this search can be adapted to find many new…
We show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses…
In this paper, we establish a lower bound on the total number of inequivalent APN functions on the finite field with $2^{2m}$ elements, where $m$ is even. We obtain this result by proving that the APN functions introduced by Pott and the…
We contribute to the exceptional APN conjecture by showing that no polynomial of degree m = 2 r (2 {\ell} + 1) where gcd(r, {\ell}) 2, r 2, {\ell} 1 with a nonzero second leading coefficient can be APN over infinitely many extensions of the…
The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…
In his monograph [Classical and quantum orthogonal polynomials in one variable, Cambridge University Press, 2005 (paperback edition 2009)], Ismail conjectured that certain structure relations involving the Askey-Wilson operator characterize…
In this paper, we classify $(q,q)$-biprojective almost perfect nonlinear (APN) functions over $\mathbb{LL} \times \mathbb{LL}$ under the natural left and right action of $\mathrm{GL}(2,\mathbb{LL})$ where $\mathbb{LL}$ is a finite field of…
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of…
In this paper, we show that there is no vectorial Boolean function of degree 4e, with e satisfaying certain conditions, which is APN over infinitely many extensions of its field of definition. It is a new step in the proof of the conjecture…
In this paper, we investigate the power functions $F(x)=x^d$ over the finite field $\mathbb{F}_{2^{4n}}$, where $n$ is a positive integer and $d=2^{3n}+2^{2n}+2^{n}-1$. It is proved that $F(x)=x^d$ is APcN at certain $c$'s in…
Planar functions are functions over a finite field that have optimal combinatorial properties and they have applications in several branches of mathematics, including algebra, projective geometry and cryptography. There are two relevant…
Functions with low c-differential uniformity have optimal resistance to some types of differential cryptanalysis. In this paper, we investigate the c-differential uniformity of power functions over finite fields. Based on some known almost…
Recently, a new concept called multiplicative differential cryptanalysis and the corresponding $c$-differential uniformity were introduced by Ellingsen et al.~\cite{Ellingsen2020}, and then some low differential uniformity functions were…
The purpose of this paper is to carry out an in-depth analysis of the intriguing van Dantzig problem which consists on characterizing the set $\mathbb{D}$ of analytic characteristic functions $\mathcal{F}$ which remains stable by the action…
Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE…
We introduce the concept of Almost-Companion Matrix (ACM) by relaxing the non-derogatory property of the standard Companion Matrix (CM). That is, we define an ACM as a matrix whose characteristic polynomial coincides with a given monic and…
We present new invariants, APN-extendibility criterion and a backtracking approach to identify several numerical facts supporting the conjecture that the set of 6-bit \APN functions is limited to 14 CCZ-classes.
We generalize the strong comparison theorem of Franjou, Friedlander, Scorichenko and Suslin to the setting of Fp-linear additive categories. Our results have a strong impact in terms of explicit computations of functor homology, and they…