Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.20982

Permutation polynomials over finite fields from low-degree rational functions

Kirpa Garg·Sartaj Ul Hasan·Chunlei Li·Hridesh Kumar·Mohit Pal
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 classes of permutation pentanomials over $F_{q^2}$. Additionally, we show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature.

Explore related subjects

cs.CRmath.NT

Keep this discovery

BibTeXRIS

Kirpa Garg, Sartaj Ul Hasan, Chunlei Li, Hridesh Kumar, Mohit Pal. 2025-08-21. Permutation polynomials over finite fields from low-degree rational functions. https://doi.org/10.3934/amc.2025040

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.CR subjectmath.NT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Supersingular Elliptic Curves Without Inseparable Small Degree Endomorphisms

For a fixed characteristic $p$, let $δ(p)$ denote the smallest degree needed to guarantee the existence of an isogeny from any supersingular curve $E$ to its Frobenius conjugate $E^{(p)}$. We translate existence questions concerning $δ(p)$ into questions about positive definite integral ternary quadratic forms and use Voronoi's theory of perfect forms in dimension three to characterize when $δ(p)$ is nearly maximal. For sufficiently large primes, we show that $δ(p)$ attains its upper bound precisely when $p$ is represented by one of nine explicit cubic polynomials, reducing the infinitude of such primes to whether one of these cubics takes prime values infinitely often. We also prove that, for almost all primes, $δ(p)$ lies at least $p^{1/6-o(1)}$ below its upper bound.

math.NT↗
arXiv2023

The second-order zero differential spectra of some APN and other maps over finite fields

The Feistel Boomerang Connectivity Table and the related notion of $F$-Boomerang uniformity (also known as the second-order zero differential uniformity) has been recently introduced by Boukerrou et al.~\cite{Bouk}. These tools shall provide a major impetus in the analysis of the security of the Feistel network-based ciphers. In the same paper, a characterization of almost perfect nonlinear functions (APN) over fields of even characteristic in terms of second-order zero differential uniformity was also given. Here, we find a sufficient condition for an odd or even function over fields of odd characteristic to be an APN function, in terms of second-order zero differential uniformity. Moreover, we compute the second-order zero differential spectra of several APN or other low differential uniform functions, and show that our considered functions also have low second-order zero differential uniformity, though it may vary widely, unlike the case for even characteristic when it is always zero.

cs.IT↗
arXiv2026

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT↗