Search arXivSearch

arXiv · 2207.04087

Generalized Almost Perfect Nonlinear Binomials and Trinomials Over Fields of Prime-Square Order

Abstract

Let $p>3$ be a prime. We show that, for each integer $d$ with $p \leq d \leq 2(p-1)$, there exists a generalized almost perfect nonlinear (GAPN) binomial or trinomial over $\mathbb{F}_{p^2}$ of algebraic degree $d$. We start by deriving sufficient conditions for the function $G \colon \mathbb{F}_{p^2} \rightarrow \mathbb{F}_{p^2}, X \mapsto X^{d_1} + u X^{d_2}$ to be GAPN in the case where one of the terms of $G$ is GAPN. We then give explicit constructions of GAPN binomials over $\mathbb{F}_{p^2}$ of any odd algebraic degree between $p$ and $2(p-1)$ and, in the case where $p$ is not a Mersenne prime, also of any even algebraic degree in this range. To obtain GAPN functions of even algebraic degree also in the general case, we finally show how to construct GAPN trinomials over $\mathbb{F}_{p^2}$ of any even algebraic degree between $p$ and $2(p-1)$ by applying a characterization of a special form of GAPN binomials by Özbudak and Sălăgean. Our constructed functions are the first GAPN functions of even algebraic degree over extension fields of odd characteristic reported so far.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christof Beierle. 2023-02-27. Generalized Almost Perfect Nonlinear Binomials and Trinomials Over Fields of Prime-Square Order. https://doi.org/10.1016/j.ffa.2023.102185

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO