English
Related papers

Related papers: The number of almost perfect nonlinear functions g…

200 papers

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

Let $F$ be a finite field, let $f$ be a function from $F$ to $F$, and let $a$ be a nonzero element of $F$. The discrete derivative of $f$ in direction $a$ is $\Delta_a f \colon F \to F$ with $(\Delta_a f)(x)=f(x+a)-f(x)$. The differential…

Information Theory · Computer Science 2026-01-01 Daniel J. Katz , Kathleen R. O'Connor , Kyle Pacheco , Yakov Sapozhnikov

An almost perfect nonlinear (APN) function (necessarily a polynomial function) on a finite field $\mathbb{F}$ is called exceptional APN, if it is also APN on infinitely many extensions of $\mathbb{F}$. In this article we consider the most…

Information Theory · Computer Science 2012-07-25 Moises Delgado , Heeralal Janwa

Functions with low differential uniformity have relevant applications in cryptography. Recently, functions with low $c$-differential uniformity attracted lots of attention. In particular, so-called APcN and PcN functions (generalization of…

Combinatorics · Mathematics 2021-02-05 Daniele Bartoli , Marco Calderini

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

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

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

In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…

Combinatorics · Mathematics 2025-01-08 Hiroaki Taniguchi , Alexandr Polujan , Alexander Pott , Razi Arshad

Two important problems on almost perfect nonlinear (APN) functions are the enumeration and equivalence problems. In this paper, we solve these two problems for any biprojective APN function family by introducing a strong group theoretic…

Combinatorics · Mathematics 2025-03-25 Faruk Göloğlu , Lukas Kölsch

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

A new almost perfect nonlinear function (APN) on the finite field GF(2^10) which is not equivalent to any of the previously known APN mappings is constructed. This is the first example of an APN mapping which is not equivalent to a power…

Combinatorics · Mathematics 2016-11-17 Yves Edel , Gohar Kyureghyan , Alexander Pott

In a prior paper \cite{EFRST20}, two of us, along with P. Ellingsen, P. Felke and A. Tkachenko, 1defined a new (output) multiplicative differential, and the corresponding $c$-differential uniformity, which has the potential of extending…

Information Theory · Computer Science 2021-03-23 Sihem Mesnager , Constanza Riera , Pantelimon Stanica , Haode Yan , Zhengchun Zhou

Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…

Cryptography and Security · Computer Science 2017-09-12 Jian Liu , Sihem Mesnager

Almost perfect nonlinear (APN) functions on finite fields of characteristic two have been studied by many researchers. Such functions have useful properties and applications in cryptography, finite geometries and so on. However APN…

Combinatorics · Mathematics 2018-07-09 Masamichi Kuroda , Shuhei Tsujie

In a prior paper [14], along with P. Ellingsen, P. Felke and A. Tkachenko, we defined a new (output) multiplicative differential, and the corresponding c-differential uniformity, which has the potential of extending differential…

Cryptography and Security · Computer Science 2020-07-07 Constanza Riera , Pantelimon Stanica

In this article, we focus on the concept of locally-APN-ness (``APN" is the abbreviation of the well-known notion of Almost Perfect Nonlinear) introduced by Blondeau, Canteaut, and Charpin, which makes the corpus of S-boxes somehow larger…

Information Theory · Computer Science 2022-08-05 Xi Xie , Sihem Mesnager , Nian Li , Debiao He , Xiangyong Zeng

In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…

Discrete Mathematics · Computer Science 2008-12-18 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

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

We propose a general approach to construct cryptographic significant Boolean functions of $(r+1)m$ variables based on the additive decomposition $\mathbb{F}_{2^{rm}}\times\mathbb{F}_{2^m}$ of the finite field $\mathbb{F}_{2^{(r+1)m}}$,…

Cryptography and Security · Computer Science 2014-01-28 Baofeng Wu , Qingfang Jin , Zhuojun Liu , Dongdai Lin

In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over $\mathbb{F}_{2^{n}}$ of the form $x^3+a(x^{2^s+1})^{2^k}+bx^{3\cdot 2^m}+c(x^{2^{s+m}+2^m})^{2^k}$, where…

Information Theory · Computer Science 2021-01-28 Lijing Zheng , Haibin Kan , Yanjun Li , Jie Peng , Deng Tang
‹ Prev 1 2 3 10 Next ›