English
Related papers

Related papers: Two low differentially uniform power permutations …

200 papers

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

This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six…

Cryptography and Security · Computer Science 2025-08-25 Kirpa Garg , Sartaj Ul Hasan , Chunlei Li , Hridesh Kumar , Mohit Pal

Let $n$ be an odd positive integer, $p$ be a prime with $p\equiv3\pmod4$, $d_{1} = {{p^{n}-1}\over {2}} -1 $ and $d_{2} =p^{n}-2$. The function defined by $f_u(x)=ux^{d_{1}}+x^{d_{2}}$ is called the generalized Ness-Helleseth function over…

Cryptography and Security · Computer Science 2024-09-02 Yongbo Xia , Chunlei Li , Furong Bao , Shaoping Chen , Tor Helleseth

Let $q = p^m$, where $p$ is an odd prime number and $m$ is a positive integer. In this paper, we examine the finite field $\mathbb{F}_{q^2}$, which consists of $q^2$ elements. We first present an alternative method to determine the…

Cryptography and Security · Computer Science 2025-01-15 Sihem Mesnager , Huawei Wu

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…

Information Theory · Computer Science 2017-10-04 Tao Bai , Yongbo Xia

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

Information Theory · Computer Science 2015-09-01 Kangquan Li , Longjiang Qu , Xi Chen

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

Information Theory · Computer Science 2014-02-25 Cunsheng Ding , Longjiang Qu , Qiang Wang , Jin Yuan , Pingzhi Yuan

Functions with low differential uniformity can be used as the s-boxes of symmetric cryptosystems as they have good resistance to differential attacks. The AES (Advanced Encryption Standard) uses a differentially-4 uniform function called…

Information Theory · Computer Science 2009-01-14 Carl Bracken , Gregor Leander

Almost perfect nonlinear (APN) functions on finite fields of characteristic two have been studied by many researchers. Such functions have useful properties and applications in cryptography, finite geometries and so on. However APN…

Combinatorics · Mathematics 2018-07-09 Masamichi Kuroda , Shuhei Tsujie

Let $m$ be a positive integer and $p$ a prime. In this paper, we investigate the differential properties of the power mapping $x^{p^m+2}$ over $\mathbb{F}_{p^n}$, where $n=2m$ or $n=2m-1$. For the case $n=2m$, by transforming the derivative…

Cryptography and Security · Computer Science 2022-04-19 Yuying Man , Yongbo Xia , Chunlei Li , Tor Helleseth

Recent studies on binomials of the form $F_r(x) = x^r(1 + \chi(x))$ over $\mathbb{F}_{p^n}$ have shown that these functions can exhibit very low boomerang uniformity. In this paper, we focus on the specific behavior of such binomials in…

Information Theory · Computer Science 2026-05-25 Namhun Koo , Soonhak Kwon , Minwoo Ko , Byunguk Kim

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

We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\it permutation polynomials ($PPs$)}, have…

Combinatorics · Mathematics 2021-03-26 Sergey Bereg , Brian Malouf , Linda Morales , Thomas Stanley , I. Hal Sudborough

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

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation…

Information Theory · Computer Science 2017-08-04 Kangquan Li , Longjiang Qu , Qiang Wang

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

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

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