A Degree Bound for the c-Boomerang Uniformity
By: Matthias Johann Steiner
Potential Business Impact:
Makes computer codes harder to break.
Let $\mathbb{F}_q$ be a finite field, and let $F \in \mathbb{F}_q [X]$ be a polynomial with $d = \text{deg} \left( F \right)$ such that $\gcd \left( d, q \right) = 1$. In this paper we prove that the $c$-Boomerang uniformity, $c \neq 0$, of $F$ is bounded by - $d^2$ if $c^2 \neq 1$, - $d \cdot (d - 1)$ if $c = -1$, - $d \cdot (d - 2)$ if $c = 1$. For all cases of $c$, we present tight examples for $F \in \mathbb{F}_q [X]$. Additionally, for the proof of $c = 1$ we establish that the bivariate polynomial $F (x) - F (y) + a \in k [x, y]$, where $k$ is a field of characteristic $p$ and $a \in k \setminus \{ 0 \}$, is absolutely irreducible if $p \nmid \text{deg} \left( F \right)$.
Similar Papers
On Differential and Boomerang Properties of a Class of Binomials over Finite Fields of Odd Characteristic
Information Theory
Makes secret codes harder to break.
Locally-APN Binomials with Low Boomerang Uniformity in Odd Characteristic
Information Theory
Makes math problems easier for computers.
Large class of many-to-one mappings over quadratic extension of finite fields
Information Theory
Makes secret codes harder to break.