English
Related papers

Related papers: APN trinomials and hexanomials

200 papers

Establishing the CCZ-equivalence of a pair of APN functions is generally quite difficult. In some cases, when seeking to show that a putative new infinite family of APN functions is CCZ inequivalent to an already known family, we rely on…

Combinatorics · Mathematics 2011-01-10 Eimear Byrne , Carl Bracken , Gary McGuire , Gabriele Nebe

We present two infinite families of APN functions where the degree of the field is divisible by 3 but not 9. Our families contain two already known families as special cases. We also discuss the inequivalence proof (by computation) which…

Information Theory · Computer Science 2008-05-01 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are…

Information Theory · Computer Science 2026-04-10 Xianhong Xie , Yi Ouyang , Shenxing Zhang

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…

Combinatorics · Mathematics 2025-10-30 Christof Beierle

All almost perfect nonlinear (APN) permutations that we know to date admit a special kind of linear self-equivalence, i.e., there exists a permutation $G$ in their CCZ-equivalence class and two linear permutations $A$ and $B$, such that $G…

Information Theory · Computer Science 2021-06-28 Christof Beierle , Marcus Brinkmann , Gregor Leander

Motivated by the observation that $2+2=4$, we consider four-dimensional $\mathcal{N}=2$ superconformal field theories on $S^2\times\Sigma$, turning on a suitable rigid supergravity background. On the one hand, reduction of a…

High Energy Physics - Theory · Physics 2026-01-05 Leonardo Rastelli , Brandon C. Rayhaun , Matteo Sacchi , Gabi Zafrir

Permutation polynomials with few terms attracts researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree…

Information Theory · Computer Science 2016-10-17 Nian Li

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

Number Theory · Mathematics 2021-11-30 P Vanchinathan , Krithika M

This paper deals with Niho functions which are one of the most important classes of functions thanks to their close connections with a wide variety of objects from mathematics, such as spreads and oval polynomials or from applied areas,…

Information Theory · Computer Science 2023-05-25 Zhexin Wang , Sihem Mesnager , Nian Li , Xiangyong Zeng

The Sun polynomials $g_n(x)$ are defined by \begin{align*} g_n(x)=\sum_{k=0}^n{n\choose k}^2{2k\choose k}x^k. \end{align*} We prove that, for any positive integer $n$, there hold \begin{align*} &\frac{1}{n}\sum_{k=0}^{n-1}(4k+3)g_k(x)…

Number Theory · Mathematics 2015-12-29 Victor J. W. Guo , Guo-Shuai Mao , Hao Pan

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

Number Theory · Mathematics 2013-10-08 Ariane M. Masuda , Michael E. Zieve

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…

Information Theory · Computer Science 2017-10-04 Tao Bai , Yongbo Xia

Dillon observed that an APN function $F$ over $\mathbb{F}_2^{n}$ with $n$ greater than $2$ must satisfy the condition $\{F(x) + F(y) + F(z) + F(x + y + z) \,:\, x,y,z \in\mathbb{F}_2^n\}= \mathbb{F}_2^n$. Recently, Taniguchi (2023)…

Information Theory · Computer Science 2023-02-28 Matteo Abbondati , Marco Calderini , Irene Villa

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

Number Theory · Mathematics 2026-02-11 Zhi-Wei Sun

Let $q$ be a power of $2$. Recently, Tu and Zeng considered trinomials of the form $f(X)=X+aX^{(1/4)q^2(q-1)}+bX^{(3/4)q^2(q-1)}$, where $a,b\in\Bbb F_{q^2}^*$. They proved that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if…

Number Theory · Mathematics 2019-06-19 Xiang-dong Hou

Let $ p \ge 5 $ be a prime and let $ b, c \in \mathbb{Z} $. Denote by $ T_k(b,c) $ the generalized central trinomial coefficient, i.e., the coefficient of $ x^k $ in $ (x^2 + bx + c)^k $. In this paper, we establish congruences modulo $ p^3…

Number Theory · Mathematics 2026-01-01 Yassine Otmani , Hacene Belbachir

Recently, Tu, Zeng, Li, and Helleseth considered trinomials of the form $f(X)=X+aX^{q(q-1)+1}+bX^{2(q-1)+1}\in\Bbb F_{q^2}[X]$, where $q$ is even and $a,b\in\Bbb F_{q^2}^*$. They found sufficient conditions on $a,b$ for $f$ to be a…

Number Theory · Mathematics 2018-03-13 Xiang-dong Hou

The construction of permutation trinomials over finite fields attracts people's interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho…

Information Theory · Computer Science 2017-02-22 Gaofei Wu , Nian Li

We determine all permutation trinomials of type $x^{2p^s+r}+x^{p^s+r}+\lambda x^r$ over the finite field $\mathbb{F}_{p^t}$ when $(2p^s+r)^4<p^t$. This partially extends a previous result by Bhattacharya and Sarkar in the case $p=2$, $r=1$.

Combinatorics · Mathematics 2017-05-19 Daniele Bartoli , Giovanni Zini

Almost perfect nonlinear (APN) functions play an important role in the design of block ciphers as they offer the strongest resistance against differential cryptanalysis. Despite more than 25 years of research, only a limited number of APN…

Combinatorics · Mathematics 2020-12-01 Christian Kaspers , Yue Zhou