On many-to-one property of generalized cyclotomic mappings
By: Yanbin Zheng , Yang Zhang , Zhengbang Zha and more
Potential Business Impact:
Makes computer codes more secure and efficient.
The generalized cyclotomic mappings over finite fields $\mathbb{F}_{q}$ are those mappings which induce monomial functions on all cosets of an index $\ell$ subgroup $C_0$ of the multiplicative group $\mathbb{F}_{q}^{*}$. Previous research has focused on the one-to-one property, the functional graphs, and their applications in constructing linear codes and bent functions. In this paper, we devote to study the many-to-one property of these mappings. We completely characterize many-to-one generalized cyclotomic mappings for $1 \le \ell \le 3$. Moreover, we completely classify $2$-to-$1$ generalized cyclotomic mappings for any divisor $\ell$ of $q-1$. In addition, we construct several classes of many-to-one binomials and trinomials of the form $x^r h(x^{q-1})$ on $\mathbb{F}_{q^2}$, where $h(x)^{q-1}$ induces monomial functions on the cosets of a subgroup of $U_{q+1}$.
Similar Papers
Large class of many-to-one mappings over quadratic extension of finite fields
Information Theory
Makes secret codes harder to break.
A Generalized $χ_n$-Function
Cryptography and Security
Makes secret codes work for all computer sizes.
Cyclotomy, cyclotomic cosets and arimetic propeties of some families in $\frac{\mathbb{F}_l[x]}{\langle x^{p^sq^t}-1\rangle}$
Number Theory
Finds math patterns in special number sets.