Table of Contents
Fetching ...

Large class of many-to-one mappings over quadratic extension of finite fields

Yanbin Zheng, Meiying Zhang, Yanjin Ding, Zhengbang Zha, Qiang Wang

TL;DR

The paper addresses the problem of characterizing many-to-one mappings on the quadratic extension $\mathbb{F}_{q^{2}}$ of a finite field, focusing on the class $f(x)=h(a x^{q}+b x+c)+u x^{q}+v x$ with $a^{q+1}=b^{q+1}$ and $a v\neq b u$. It develops a unifying reduction via a commutative diagram built from trace maps to relate $f$ on $\mathbb{F}_{q^{2}}$ to an associated polynomial $g$ on $\mathbb{F}_{q}$, such that $f$ is $m$-to-$1$ on $\mathbb{F}_{q^{2}}$ iff $m|q$ and $g$ is $m$-to-$1$ on $\mathbb{F}_{q}$. By taking $h(x)=x^{r}$ with $r$ in various families, $g$ reduces to low-degree polynomials or linearized forms, enabling explicit classifications of $m$-to-$1$ mappings for $f$ across degrees 2, 3, 4, and linearized cases; the paper also derives inverses for all $1$-to-$1$ instances and constructs involutions from certain $2$-to-$1$ mappings, thereby unifying and extending prior results. Practical implications lie in systematic construction and inversion of such mappings for cryptographic and coding-theoretic applications. The work provides a comprehensive framework for translating high-degree, finite-field mappings into tractable small-degree or linearized subproblems on $\mathbb{F}_{q}$.

Abstract

Many-to-one mappings and permutation polynomials over finite fields have important applications in cryptography and coding theory. In this paper, we study the many-to-one property of a large class of polynomials such as $f(x) = h(a x^q + b x + c) + u x^q + v x$, where $h(x) \in \mathbb{F}_{q^2}[x]$ and $a$, $b$, $c$, $u$, $v \in \mathbb{F}_{q^2}$. Using a commutative diagram satisfied by $f(x)$ and trace functions over finite fields, we reduce the problem whether $f(x)$ is a many-to-one mapping on $\mathbb{F}_{q^2}$ to another problem whether an associated polynomial $g(x)$ is a many-to-one mapping on the subfield $\mathbb{F}_{q}$. In particular, when $h(x) = x^{r}$ and $r$ satisfies certain conditions, we reduce $g(x)$ to polynomials of small degree or linearized polynomials. Then by employing the many-to-one properties of these low degree or linearized polynomials on $\mathbb{F}_{q}$, we derive a series of explicit characterization for $f(x)$ to be many-to-one on $\mathbb{F}_{q^2}$. On the other hand, for all $1$-to-$1$ mappings obtained in this paper, we determine the inverses of these permutation polynomials. Moreover, we also explicitly construct involutions from $2$-to-$1$ mappings of this form. Our findings generalize and unify many results in the literature.

Large class of many-to-one mappings over quadratic extension of finite fields

TL;DR

The paper addresses the problem of characterizing many-to-one mappings on the quadratic extension of a finite field, focusing on the class with and . It develops a unifying reduction via a commutative diagram built from trace maps to relate on to an associated polynomial on , such that is -to- on iff and is -to- on . By taking with in various families, reduces to low-degree polynomials or linearized forms, enabling explicit classifications of -to- mappings for across degrees 2, 3, 4, and linearized cases; the paper also derives inverses for all -to- instances and constructs involutions from certain -to- mappings, thereby unifying and extending prior results. Practical implications lie in systematic construction and inversion of such mappings for cryptographic and coding-theoretic applications. The work provides a comprehensive framework for translating high-degree, finite-field mappings into tractable small-degree or linearized subproblems on .

Abstract

Many-to-one mappings and permutation polynomials over finite fields have important applications in cryptography and coding theory. In this paper, we study the many-to-one property of a large class of polynomials such as , where and , , , , . Using a commutative diagram satisfied by and trace functions over finite fields, we reduce the problem whether is a many-to-one mapping on to another problem whether an associated polynomial is a many-to-one mapping on the subfield . In particular, when and satisfies certain conditions, we reduce to polynomials of small degree or linearized polynomials. Then by employing the many-to-one properties of these low degree or linearized polynomials on , we derive a series of explicit characterization for to be many-to-one on . On the other hand, for all -to- mappings obtained in this paper, we determine the inverses of these permutation polynomials. Moreover, we also explicitly construct involutions from -to- mappings of this form. Our findings generalize and unify many results in the literature.

Paper Structure

This paper contains 14 sections, 38 theorems, 92 equations, 1 table.

Key Result

Theorem 2.1

Let $A$, $\bar{A}$, $S$, $\bar{S}$ be finite sets and $f \colon A \rightarrow \bar{A}$, $\bar{f} \colon S \rightarrow \bar{S}$, $\lambda \colon A \rightarrow S$, $\bar{\lambda} \colon \bar{A} \rightarrow \bar{S}$ be mappings such that $\bar{\lambda} \circ f = \bar{f} \circ \lambda$, i.e., the follo Then for $1 \le m \le m_1 \, \#S$, $f$ is $m$-to-$1$ on $A$ if and only if $m_1 \mid m$, $\bar{f}$

Theorems & Definitions (63)

  • Definition 2.1: Zhengmto1
  • Example 2.1
  • Example 2.2
  • Theorem 2.1: Zhengmto1
  • Lemma 2.2: AFF
  • Lemma 2.3: 2to1-MesQ19
  • Theorem 2.4
  • Theorem 2.5: 2to1-MesQ19
  • Theorem 2.6: AFF
  • Theorem 2.7: 2to1-MesQ19
  • ...and 53 more