Frobenius linear translators giving rise to new infinite classes of permutations and bent functions

From MaRDI portal
Publication:2179495



Abstract: We show the existence of many infinite classes of permutations over finite fields and bent functions by extending the notion of linear translators, introduced by Kyureghyan [12]. We call these translators Frobenius translators since the derivatives of f:FpnightarrowFpk, where n=rk, are of the form f(x+uphi)−f(x)=upib, for a fixed binFpk and all uinFpk, rather than considering the standard case corresponding to i=0. This considerably extends a rather rare family {f} admitting linear translators of the above form. Furthermore, we solve a few open problems in the recent article [4] concerning the existence and an exact specification of f admitting classical linear translators, and an open problem introduced in [9] of finding a triple of bent functions f1,f2,f3 such that their sum f4 is bent and that the sum of their duals f1∗+f2∗+f3∗+f4∗=1. Finally, we also specify two huge families of permutations over Fpn related to the condition that G(y)=−L(y)+(y+delta)s−(y+delta)pks permutes the set , where n=2k and p>2. Finally, we offer generalizations of constructions of bent functions from [16] and described some new bent families using the permutations found in [4].












This page was built for publication: Frobenius linear translators giving rise to new infinite classes of permutations and bent functions

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