Large class of many-to-one mappings over quadratic extension of finite fields
arXiv:2503.06640
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.