English
Related papers

Related papers: Two Classes of Crooked Multinomials Inequivalent t…

200 papers

We present an infinite family of quadratic APN functions on a finite field of dimension over GF(2) divisible by 3.

General Mathematics · Mathematics 2007-07-10 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

We systematically analyze a class of hexanomial functions over finite fields of characteristic $2$ proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functions, significantly extending earlier partial-APN results.…

Number Theory · Mathematics 2026-02-24 Daniele Bartoli , Giovanni Giuseppe Grimaldi , Pantelimon Stanica

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

We consider exceptional APN functions on ${\bf F}_{2^m}$, which by definition are functions that are not APN on infinitely many extensions of ${\bf F}_{2^m}$. Our main result is that polynomial functions of odd degree are not exceptional,…

Algebraic Geometry · Mathematics 2009-11-13 Yves Aubry , Gary Mcguire , François Rodier

In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a…

Information Theory · Computer Science 2019-05-31 Lilya Budaghyan , Nikolay S. Kaleyski , Soonhak Kwon , Constanza Riera , Pantelimon Stanica

It is well known that a quadratic function defined on a finite field of odd degree is almost bent (AB) if and only if it is almost perfect nonlinear (APN). For the even degree case there is no apparent relationship between the values in the…

Information Theory · Computer Science 2008-12-01 Carl Bracken , Zhengbang Zha

We give all the polynomials functions of degree 20 which are APN over an infinity of field extensions and show they are all CCZ-equivalent to the function $x^5$, which is a new step in proving the conjecture of Aubry, McGuire and Rodier.

Information Theory · Computer Science 2013-01-28 Florian Caullery

We prove a necessary condition for some polynomials of degree 4e (e an odd number) to be APN over F q n for large n, and we investigate the polynomials f of degree 12.

Number Theory · Mathematics 2016-02-03 François Rodier

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…

Combinatorics · Mathematics 2022-06-03 Faruk Göloğlu

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…

Information Theory · Computer Science 2021-04-28 Xiaoqiang Wang , Dabin Zheng

The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…

Algebraic Geometry · Mathematics 2008-05-02 François Rodier

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…

Information Theory · Computer Science 2021-07-15 Ziran Tu , Xiangyong Zeng , Yupeng Jiang , Xiaohu Tang

Almost Perfect Nonlinear (APN) functions are very useful in cryptography, when they are used as S-Boxes, because of their good resistance to differential cryptanalysis. An APN function $f:\mathbb{F}_{2^n}\rightarrow\mathbb{F}_{2^n}$ is…

Number Theory · Mathematics 2016-02-09 Moises Delgado , Heeralal Janwa

We give a large family of almost perfect nonlinear (APN) permutations of finite vector spaces of every odd dimension divisible by three. We also give APN functions that are not bijective on even dimensions and related highly nonlinear…

Combinatorics · Mathematics 2026-05-19 Faruk Göloğlu , Lukas Kölsch

In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form $f(x)=\sum_{i=1}^{\frac{m}{2}-1} Tr^n_1(c_ix^{1+2^{ei}})+ Tr_1^{n/2}(c_{m/2}x^{1+2^{n/2}}) ,$ where $n=me$, $m$ is even and $c_i\in…

Information Theory · Computer Science 2013-08-14 Chunming Tang , Yanfeng Qi

APN functions play a fundamental role in cryptography against attacks on block ciphers. Several families of quadratic APN functions have been proposed in the recent years, whose construction relies on the existence of specific families of…

Combinatorics · Mathematics 2021-07-21 Daniele Bartoli , Marco Calderini , Olga Polverino , Ferdinando Zullo

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…

Information Theory · Computer Science 2020-08-28 Zhengbang Zha , Lei Hu

In this article a technique for constructing $p$-ary bent functions from near-bent functions is presented. Two classes of quadratic $p$-ary functions are shown to be near-bent. Applying the construction of bent functions to these classes of…

Combinatorics · Mathematics 2010-11-30 Ayca Cesmelioglu , Gary McGuire , Wilfried Meidl

The problem of finding APN permutations of ${\mathbb F}_{2^n}$ where $n$ is even and $n>6$ has been called the Big APN Problem. Li, Li, Helleseth and Qu recently characterized APN functions defined on ${\mathbb F}_{q^2}$ of the form…

Information Theory · Computer Science 2020-09-15 Benjamin Chase , Petr Lisonek

In this paper we present a new class of perfect nonlinear %Dembowski-Ostrom polynomials over $\mathbb{F}_{p^{2k}}$ for any odd prime $p$. In addition, we show that the new perfect nonlinear functions are CCZ-inequivalent to all the…

Information Theory · Computer Science 2019-05-06 Jinquan Luo , Junru Ma , Min Tu