English
Related papers

Related papers: The differential properties of certain permutation…

200 papers

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

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

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

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 article, we introduce new notions $cc$-differential uniformity, $cc$-differential spectrum, PccN functions and APccN functions, and investigate their properties. We also introduce $c$-CCZ equivalence, $c$-EA equivalence, and…

Information Theory · Computer Science 2023-01-24 Nhan-Phu Chung , Jaeseong Jeong , Namhun Koo , Soonhak Kwon

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

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

We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…

Number Theory · Mathematics 2025-07-01 Ruikai Chen

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…

Information Theory · Computer Science 2016-05-23 Kangquan Li , Longjiang Qu , Chao Li , Shaojing Fu

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

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

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

We present new classes of permutation polynomials over finite fields.

Number Theory · Mathematics 2010-06-10 Jose E. Marcos

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

Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have…

Information Theory · Computer Science 2019-08-08 Xiaogang Liu

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

Probability · Mathematics 2018-09-17 Valentin Bahier

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

A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…

Combinatorics · Mathematics 2013-04-16 Baofeng Wu , Zhuojun Liu

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…

Combinatorics · Mathematics 2016-11-01 Frédérique Bassino , Mathilde Bouvel , Adeline Pierrot , Carine Pivoteau , Dominique Rossin