English
Related papers

Related papers: Constructing rotatable permutations of $\mathbb{F}…

200 papers

Recently, P. Yuan presented a local method to find permutation polynomials and their compositional inverses over finite fields. The work of P. Yuan inspires us to compute the compositional inverses of three classes of the permutation…

Number Theory · Mathematics 2024-10-16 Danyao Wu , Pingzhi Yuan

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

High Energy Physics - Theory · Physics 2009-10-28 S. Boukraa , J-M. Maillard , G. Rollet

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

Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of…

Number Theory · Mathematics 2023-12-29 Yi Li , Xiutao Feng , Qiang Wang

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

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

Combinatorics · Mathematics 2023-06-30 P Vanchinathan , Kevinsam B

We study the group of transformations of 4F3 hypergeometric functions evaluated at unity with one unit shift in parameters. We reveal the general form of this family of transformations and its group property. Next, we use explicitly known…

Classical Analysis and ODEs · Mathematics 2020-09-29 Dmitrii Karp , Elena Prilepkina

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

Information Theory · Computer Science 2019-07-09 Xiaogang Liu

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

Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…

Information Theory · Computer Science 2017-06-02 Yanping Wang , WeiGuo Zhang , Zhengbang Zha

In this paper we take a deeper look at the self conjugate reciprocal (SCR) polynomials, which towards the end of the paper aid the construction of new classes of permutation polynomials of simpler forms over $\mathbb{F}_{q^{2}}$. The paper…

Number Theory · Mathematics 2024-09-16 Bidushi Sharma , Dhiren Kumar Basnet

For the finite field $\mathbb{F}_{2^{3m}}$, permutation polynomials of the form $(x^{2^m}+x+\delta)^{s}+cx$ are studied. Necessary and sufficient conditions are given for the polynomials to be permutation polynomials. For this, the…

Information Theory · Computer Science 2019-07-30 Xiaogang Liu

Differentially 4-uniform permutations on $\gf_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred…

Information Theory · Computer Science 2014-07-22 Longjiang Qu , Yin Tan , Chao Li , Guang Gong

We consider real forms of relatively minimal rational surfaces F_m. Connected components of moduli of real non-singular curves in |-2K_{F_m}| had been classified recently for m=0, 1, 4 in math.AG/0312396. Applying similar methods, here we…

Algebraic Geometry · Mathematics 2009-12-08 Viacheslav V. Nikulin , Sachiko Saito

In [1], a new quasi-Hermitian variety $\mathcal{H}_\varepsilon^r$ in $\mathrm{PG}(r, q^2)$, with $q = 2^e$ and $e \geq 3$ an odd integer, was constructed. The variety depends on a primitive element $\varepsilon$ of the underlying field…

Combinatorics · Mathematics 2025-08-07 Angela Aguglia , Alessandro Montinaro

By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…

Information Theory · Computer Science 2024-02-13 Stefano Lia , Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti

Finding permutation polynomials with low differential and boomerang uniformityis an important topic in S-box designs of many block ciphers. For example, AES chooses the inverse function as its S-box, which is differentially 4-uniform and…

Information Theory · Computer Science 2020-09-21 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

We determine all permutation polynomials among several families of polynomials over $\mathbb{F}_{q^3}$ for arbitrary prime powers $q$. We obtain some new families of permutation polynomials over $\mathbb{F}_{q^3}$ with simple coefficients…

Combinatorics · Mathematics 2026-05-18 Zhiguo Ding , Xu Song , Wei Xiong

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Information Theory · Computer Science 2013-08-28 Pingzhi Yuan , Cunsheng Ding

An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know,…

Information Theory · Computer Science 2018-11-29 Dabin Zheng , Mu Yuan , Nian Li , Lei Hu , Xiangyong Zeng