English
Related papers

Related papers: Several classes of PcN power functions over finite…

200 papers

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

Group Theory · Mathematics 2015-03-09 J. C. Birget

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

Functions with low differential uniformity can be used in a block cipher as S-boxes since they have good resistance to differential attacks. In this paper we consider piecewise constructions for permutations with low differential…

Information Theory · Computer Science 2020-09-22 Marco Calderini

In the literature, there are many APN-like functions that generalize the APN properties or are similar to APN functions, e.g. locally-APN functions, 0-APN functions or those with boomerang uniformity 2. In this paper, we study the problem…

Information Theory · Computer Science 2022-09-28 Longjiang Qu , Kangquan Li

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

Differentially 4-uniform permutations on $\gf_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred…

Information Theory · Computer Science 2014-07-22 Longjiang Qu , Yin Tan , Chao Li , Guang Gong

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

Deep Neural Networks (DNNs) deliver impressive performance but their black-box nature limits deployment in high-stakes domains requiring transparency. We introduce Compositional Function Networks (CFNs), a novel framework that builds…

Machine Learning · Computer Science 2025-08-01 Fang Li

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

It is known that crooked functions can be used to construct many interesting combinatorial objects, and a quadratic function is crooked if and only if it is almost perfect nonlinear (APN). In this paper, we introduce two infinite classes of…

Cryptography and Security · Computer Science 2011-11-08 Xueying Duan , Qichun Wang

We enrich the class of power-constructible functions, introduced in [CCRS23], to a class of algebras of functions which contains all complex powers of subanalytic functions, their parametric Mellin and Fourier transforms, and which is…

Classical Analysis and ODEs · Mathematics 2024-12-04 Raf Cluckers , Georges Comte , Tamara Servi

Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well…

Information Theory · Computer Science 2014-07-21 Jie Peng , Chik How Tan , Qichun Wang

Block ciphers use S-boxes to create confusion in the cryptosystems. Such S-boxes are functions over $\mathbb{F}_{2^{n}}$. These functions should have low differential uniformity, high nonlinearity, and high algebraic degree in order to…

Cryptography and Security · Computer Science 2021-03-22 Yan-Ping Wang , WeiGuo Zhang , Zhengbang Zha

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

Parabolic Cylinder functions (PCFs) are classical special functions with applications in many different fields. However, there is little information available regarding simple uniform approximations and bounds for these functions. We obtain…

Classical Analysis and ODEs · Mathematics 2020-10-22 Javier Segura

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

Let $F$ be a function from $\mathbb{F}_{p^n}$ to itself and $\delta$ a positive integer. $F$ is called zero-difference $\delta$-balanced if the equation $F(x+a)-F(x)=0$ has exactly $\delta$ solutions for all non-zero $a\in\mathbb{F}_{p^n}$.…

Information Theory · Computer Science 2014-11-03 Claude Carlet , Guang Gong , Yin Tan

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

Here, we give a complete description of the c-Boomerang Connectivity Table for the Gold function over finite fields of even characteristic, by using double Weil sums. In the process we generalize a result of Boura and Canteaut (IACR Trans.…

Number Theory · Mathematics 2022-04-28 Sartaj Ul Hasan , Mohit Pal , Pantelimon Stanica

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