English
Related papers

Related papers: New P$c$N and AP$c$N functions over finite fields

200 papers

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

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

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

Recently, a new concept called the $c$-differential uniformity was proposed by Ellingsen et al. (2020), which allows to simplify some types of differential cryptanalysis. Since then, finding functions having low $c$-differential uniformity…

Information Theory · Computer Science 2022-06-27 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

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

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

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

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

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

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

We study the problem of approximating and learning coverage functions. A function $c: 2^{[n]} \rightarrow \mathbf{R}^{+}$ is a coverage function, if there exists a universe $U$ with non-negative weights $w(u)$ for each $u \in U$ and subsets…

Machine Learning · Computer Science 2014-05-29 Vitaly Feldman , Pravesh Kothari

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

Power functions with low $c$-differential uniformity have been widely studied not only because of their strong resistance to multiplicative differential attacks, but also low implementation cost in hardware. Furthermore, the…

Information Theory · Computer Science 2023-11-03 Huan Zhou , Xiaoni Du , Wenping Yuan , Xingbin Qiao

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

Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…

Information Theory · Computer Science 2020-07-30 Yuting Chen , Liqi Wang , Shixin Zhu

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

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

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

Let $\gf_{p^n}$ denote the finite field containing $p^n$ elements, where $n$ is a positive integer and $p$ is a prime. The function $f_u(x)=x^{\frac{p^n+3}{2}}+ux^2$ over $\gf_{p^n}[x]$ with $u\in\gf_{p^n}\setminus\{0,\pm1\}$ was recently…

Information Theory · Computer Science 2025-01-09 Haode Yan , Ketong Ren

Negabent functions as a class of generalized bent functions have attracted a lot of attention recently due to their applications in cryptography and coding theory. In this paper, we consider the constructions of negabent functions over…

Information Theory · Computer Science 2016-06-30 Gaofei Wu , Nian Li , Yuqing Zhang , Xuefeng Liu
‹ Prev 1 2 3 10 Next ›