Permutations via linear translators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Finite Fields and Their Applications Year : 2017

Permutations via linear translators

Abstract

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of \cite{kyu}, we give in several cases the compositional inverse of these permutations. The connection with complete permutations is also utilized to provide further infinite classes of permutations. Moreover, we propose new tools to study permutations of the form $x\mapsto x+(x^{p^m}-x+\delta)^s$ and a few infinite classes of permutations of this form are proposed.
Fichier principal
Vignette du fichier
translator_main_FFA_Final_Nov12_V2.pdf (131.83 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01412487 , version 1 (08-12-2016)
hal-01412487 , version 2 (12-12-2016)

Identifiers

Cite

Nastja Cepak, Pascale Charpin, Enes Pasalic. Permutations via linear translators. Finite Fields and Their Applications, 2017, 45, pp.19--42. ⟨10.1016/j.ffa.2016.11.009⟩. ⟨hal-01412487v2⟩

Collections

INRIA INRIA2
244 View
190 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More