Large class of many-to-one mappings over quadratic extension of finite fields
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 xq + b x + c) + u xq + v x, where h(x) ∈ Fq2[x] and a, b, c, u, v ∈ Fq2. 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 Fq2 to another problem whether an associated polynomial g(x) is a many-to-one mapping on the subfield Fq. In particular, when h(x) = xr 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 Fq, we derive a series of explicit characterization for f(x) to be many-to-one on Fq2. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.