Constructions of Involutions Over Finite Fields

From MaRDI portal
Publication:5211546




Abstract: An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know, there are not many involutions, and there isn't a general way to construct involutions over finite fields. This paper gives a necessary and sufficient condition for the polynomials of the form to be involutions over the finite field~, where rgeq1 and s,|,(q1). By using this criterion we propose a general method to construct involutions of the form xrh(xs) over from given involutions over the corresponding subgroup of . Then, many classes of explicit involutions of the form xrh(xs) over are obtained.










This page was built for publication: Constructions of Involutions Over Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211546)