English
Related papers

Related papers: Two low differentially uniform power permutations …

200 papers

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

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 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

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

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

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

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

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Information Theory · Computer Science 2016-06-15 Jingxue Ma , Tao Zhang , Tao Feng , Gennian Ge

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 $n$ be a positive integer and $p$ a prime. The power mapping $x^{p^n-3}$ over $\mathbb{F}_{p^n}$ has desirable differential properties, and its differential spectra for $p=2,\,3$ have been determined. In this paper, for any odd prime…

Information Theory · Computer Science 2021-08-09 Haode Yan , Yongbo Xia , Chunlei Li , Tor Helleseth , Maosheng Xiong , Jinquan Luo

This paper makes the first bridge between the classical differential/boomerang uniformity and the newly introduced $c$-differential uniformity. We show that the boomerang uniformity of an odd APN function is given by the maximum of the…

Information Theory · Computer Science 2024-08-07 Mohit Pal , Pantelimon Stanica

In this paper, we investigate the differential and boomerang properties of a class of binomial $F_{r,u}(x) = x^r(1 + u\chi(x))$ over the finite field $\mathbb{F}_{p^n}$, where $r = \frac{p^n+1}{4}$, $p^n \equiv 3 \pmod{4}$, and $\chi(x) =…

Information Theory · Computer Science 2026-01-07 Namhun Koo , Soonhak Kwon

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

Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic technique on analysing the resistance of the Feistel network-based ciphers to power attacks such as differential and boomerang attacks. Moreover, the coefficients of…

Cryptography and Security · Computer Science 2024-09-20 Huan Zhou , Xiaoni Du , Xingbin Qiao , Wenping Yuan

This paper deals with Niho functions which are one of the most important classes of functions thanks to their close connections with a wide variety of objects from mathematics, such as spreads and oval polynomials or from applied areas,…

Information Theory · Computer Science 2023-05-25 Zhexin Wang , Sihem Mesnager , Nian Li , Xiangyong Zeng

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

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

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

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

Number Theory · Mathematics 2025-12-29 Xuan Pang , Danyao Wu , Pingzhi Yuan

Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE…

Number Theory · Mathematics 2026-02-24 Daniele Bartoli , Mohit Pal , Pantelimon Stanica , Tommaso Toccotelli
‹ Prev 1 2 3 10 Next ›