English
Related papers

Related papers: On non-monomial APcN permutations over finite fiel…

200 papers

The concept of differential uniformity was recently extended to the $c$-differential uniformity. An interesting problem in this area is the construction of functions with low $c$-differential uniformity and a lot of research has been done…

Information Theory · Computer Science 2022-08-02 Mohit Pal

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

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

The notion of $c$-differential uniformity has recently received a lot of attention since its proposal~\cite{Ellingsen}, and recently a characterization of perfect $c$-nonlinear functions in terms of difference sets in some quasigroups was…

Information Theory · Computer Science 2023-07-21 Kirpa Garg , Sartaj Ul Hasan , Pantelimon Stanica

Very recently, a new concept called multiplicative differential (and the corresponding $c$-differential uniformity) was introduced by Ellingsen \textit{et al} in [C-differentials, multiplicative uniformity and (almost) perfect…

Information Theory · Computer Science 2020-04-27 Haode Yan , Sihem Mesnager , Zhengchun Zhou

Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…

Combinatorics · Mathematics 2025-01-28 Kirpa Garg , Sartaj Ul Hasan , Pantelimon Stanica

In this paper we define a new (output) multiplicative differential, and the corresponding $c$-differential uniformity. With this new concept, even for characteristic $2$, there are perfect $c$-nonlinear (PcN) functions. We first…

Information Theory · Computer Science 2019-09-10 Pal Ellingsen , Patrick Felke , Constanza Riera , Pantelimon Stanica , Anton Tkachenko

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

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

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 paper we generalize Dillon's switching method to characterize the exact $c$-differential uniformity of functions constructed via this method. More precisely, we modify some PcN/APcN and other functions with known $c$-differential…

Information Theory · Computer Science 2022-04-20 Chunlei Li , Constanza Riera , 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

We give some classes of power maps with low $c$-differential uniformity over finite fields of odd characteristic, {for $c=-1$}. Moreover, we give a necessary and sufficient condition for a linearized polynomial to be a perfect $c$-nonlinear…

Combinatorics · Mathematics 2021-02-23 Sartaj Ul Hasan , Mohit Pal , Constanza Riera , Pantelimon Stanica

We investigate permutation polynomials F over finite fields F_{p^n} whose generalized derivative maps x -> F(x + a) - cF(x) are themselves permutations for all nonzero shifts a. This property, termed perfect c-nonlinearity (PcN), represents…

Information Theory · Computer Science 2026-02-26 Ranit Dutta , Pantelimon Stanica , Bimal Mandal

We defined in~\cite{EFRST20} a new multiplicative $c$-differential, and the corresponding $c$-differential uniformity and we characterized the known perfect nonlinear functions with respect to this new concept, as well as the inverse in any…

Information Theory · Computer Science 2020-04-27 Pantelimon Stanica

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. Inspired by this pioneering work, power functions with low c-differential uniformity were constructed. Wang et al. defined the c-differential…

Information Theory · Computer Science 2022-01-19 K. Zhang , H. D. Yan

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

In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.

Number Theory · Mathematics 2013-12-04 Guangkui Xu , Xiwang Cao , Ziran Tu , Xiangyong Zeng , Lei Hu

Very recently, a new concept called multiplicative differential and the corresponding $c$-differential uniformity were introduced by Ellingsen et al. A function $F(x)$ over finite field $\mathrm{GF}(p^n)$ to itself is called…

Information Theory · Computer Science 2021-01-27 Haode Yan

Let $\mathbb{F}_q$ be a finite field of characteristic $p$. In this paper we prove that the $c$-Boomerang Uniformity, $c \neq 0$, for all permutation monomials $x^d$, where $d > 1$ and $p \nmid d$, is bounded by $d^2$. Further, we utilize…

Number Theory · Mathematics 2024-11-08 Matthias Johann Steiner
‹ Prev 1 2 3 10 Next ›