English
Related papers

Related papers: On lower bounds for the distances between APN func…

200 papers

We introduce a new concept, the APN-defect, which can be thought of as measuring the distance of a given function $G:\mathbb{F}_{2^n} \rightarrow \mathbb{F}_{2^n}$ to the set of almost perfect nonlinear (APN) functions. This concept is…

Information Theory · Computer Science 2024-06-12 Nurdagül Anbar , Tekgül Kalaycı , Alev Topuzoğlu

In this paper, we study the Hamming distance between vectorial Boolean functions and affine functions. This parameter is known to be related to the non-linearity and differential uniformity of vectorial functions, while the calculation of…

Combinatorics · Mathematics 2025-03-07 Gabor P. Nagy

In this paper, we present two new infinite classes of APN functions over $\gf_{{2^{2m}}}$ and $\gf_{{2^{3m}}}$, respectively. The first one is with bivariate form and obtained by adding special terms,…

Information Theory · Computer Science 2021-05-19 Kangquan Li , Yue Zhou , Chunlei Li , Longjiang Qu

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…

Combinatorics · Mathematics 2020-02-05 Christian Kaspers , Yue Zhou

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

Recently, the investigation of Partially APN functions has attracted a lot of attention. In this paper, with the help of resultant elimination and MAGMA, we propose several new infinite classes of 0-APN power functions over…

Information Theory · Computer Science 2022-10-28 Tao Fu , Haode Yan

In this extended abstract, we computationally check and list the CCZ-inequivalent APN functions from infinite families on $\mathbb{F}_2^n$ for n from 6 to 11. These functions are selected with simplest coefficients from CCZ-inequivalent…

Cryptography and Security · Computer Science 2017-09-25 Bo Sun

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

The investigation of partially APN functions has attracted a lot of research interest recently. In this paper, we present several new infinite classes of 0-APN power functions over $\mathbb{F}_{2^n}$ by using the multivariate method and…

Information Theory · Computer Science 2022-12-12 Yuying Man , Shizhu Tian , Nian Li , Xiangyong Zeng

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

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 obtain the following results. For any prime $q$ the minimal Hamming distance between distinct regular $q$-ary bent functions of $2n$ variables is equal to $q^n$. The number of $q$-ary regular bent functions at the distance $q^n$ from the…

Information Theory · Computer Science 2023-03-30 Vladimir N. Potapov

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…

Information Theory · Computer Science 2021-12-24 Christof Beierle , Gregor Leander

For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…

Combinatorics · Mathematics 2019-05-02 Zhixiong Chen , Andrew Klapper

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes…

Quantum Physics · Physics 2008-01-09 Lars Eirik Danielsen

APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is…

Combinatorics · Mathematics 2026-05-19 Sophie Hannah Bénéteau , Nicolas Goluboff , Lukas Kölsch , Divyesh Vaghasiya

In this work, we study functions that can be obtained by restricting a vectorial Boolean function $F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ to an affine hyperplane of dimension $n-1$ and then projecting the output to an…

Information Theory · Computer Science 2022-03-29 Christof Beierle , Gregor Leander , Léo Perrin

In this paper, by the Hasse-Weil bound, we determine the necessary and sufficient condition on coefficients $a_1,a_2,a_3\in\mathbb{F}_{2^n}$ with $n=2m$ such that $f(x) = {x}^{3\cdot2^m} + a_1x^{2^{m+1}+1} + a_2 x^{2^m+2} + a_3x^3$ is an…

Information Theory · Computer Science 2020-07-09 Kangquan Li , Chunlei Li , Tor Helleseth , Longjiang Qu

Only three classes of Almost Perfect Nonlinear (for short, APN) power functions over odd characteristic finite fields have been investigated in the literature, and their differential spectra were determined. The differential uniformity of…

Information Theory · Computer Science 2022-10-20 Haode Yan , Sihem Mesnager , Xiantong Tan

We show that the there exists an infinite family of APN functions of the form $F(x)=x^{2^{s}+1} + x^{2^{k+s}+2^k} + cx^{2^{k+s}+1} + c^{2^k}x^{2^k + 2^s} + \delta x^{2^{k}+1}$, over $\gf_{2^{2k}}$, where $k$ is an even integer and…

Information Theory · Computer Science 2011-10-17 Carl Bracken , Chik How Tan , Tan Yin
‹ Prev 1 2 3 10 Next ›