English
Related papers

Related papers: Power Functions over Finite Fields with Low $c$-Di…

200 papers

Drawing inspiration from Nyberg's paper~\cite{Nyb91} on perfect nonlinearity and the $c$-differential notion we defined in~\cite{EFRST20}, in this paper we introduce the concept of $c$-differential bent functions in two different ways (thus…

Information Theory · Computer Science 2020-06-24 Pantelimon Stanica , Sugata Gangopadhyay , Aaron Geary , Constanza Riera , Anton Tkachenko

Differential uniformity is a significant concept in cryptography as it quantifies the degree of security of S-boxes respect to differential attacks. Power functions of the form $F(x)=x^d$ with low differential uniformity have been…

Information Theory · Computer Science 2020-12-09 Nian Li , Yanan Wu , Xiangyong Zeng , Xiaohu Tang

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

EFRST20, the notion of $c$-differentials was introduced as a potential expansion of differential cryptanalysis against block ciphers utilizing substitution boxes. Drawing inspiration from the technique of higher order differential…

Information Theory · Computer Science 2021-11-09 Aaron Geary , Marco Calderini , Constanza Riera , Pantelimon Stanica

In this paper, we construct some piecewise defined functions, and study their $c$-differential uniformity. As a by-product, we improve upon several prior results. Further, we look at concatenations of functions with low differential…

Information Theory · Computer Science 2021-12-07 Daniele Bartoli , Marco Calderini , Constanza Riera , Pantelimon Stanica

The study of Boolean functions with low $c$-differential uniformity has become recently an important topic of research. However, in odd characteristic case, there are not many results on the ($c$-)differential uniformity of functions that…

Information Theory · Computer Science 2024-10-17 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

In this paper, two new classes of perfect nonlinear functions over $\mathbb{F}_{p^{2m}}$ are proposed, where $p$ is an odd prime. Furthermore, we investigate the nucleus of the corresponding semifields of these functions and show that the…

Information Theory · Computer Science 2019-05-09 Jinquan Luo , Junru Ma

Starting with the multiplication of elements in $\mathbb{F}_{q}^2$ which is consistent with that over $\mathbb{F}_{q^2}$, where $q$ is a prime power, via some identification of the two environments, we investigate the $c$-differential…

Information Theory · Computer Science 2022-12-27 Yanan Wu , Pantelimon Stănică , Chunlei Li , Nian Li , Xiangyong Zeng

In this paper, for an odd prime $p$, the differential spectrum of the power function $x^{\frac{p^k+1}{2}}$ in $\mathbb{F}_{p^n}$ is calculated. For an odd prime $p$ such that $p\equiv 3\bmod 4$ and odd $n$ with $k|n$, the differential…

Cryptography and Security · Computer Science 2012-07-10 Sung-Tai Choi , Seokbeom Hong , Jong-Seon No , Habong Chung

Building upon the observation that the newly defined~\cite{EFRST20} concept of $c$-differential uniformity is not invariant under EA or CCZ-equivalence~\cite{SPRS20}, we showed in~\cite{SG20} that adding some appropriate linearized…

Number Theory · Mathematics 2020-09-17 Pantelimon Stanica , Constanza Riera , Anton Tkachenko

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

It was shown by Boukerrou et al.~[IACR Trans. Symmetric Cryptol. 1 (2020), 331--362] that the $F$-boomerang uniformity (which is the same as the second-order zero differential uniformity in even characteristic) of perfect nonlinear…

Information Theory · Computer Science 2025-01-28 Kirpa Garg , Sartaj Ul Hasan , Constanza Riera , Pantelimon Stanica

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 this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

Probability · Mathematics 2023-12-06 Jnaneshwar Baslingker , Biltu Dan

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

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

The $c$-differential uniformity is recently proposed to reflect resistance against some variants of differential attack. Finding functions with low $c$-differential uniformity is attracting attention from many researchers. For even…

Information Theory · Computer Science 2022-02-07 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

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

Maximum nonlinear functions on finite fields are widely used in cryptography because the coordinate functions have large distance to linear functions. More precisely, the Hamming distance to the characteristic functions of hyperplanes is…

Combinatorics · Mathematics 2007-05-23 Doreen Hertel , Alexander Pott

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