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.
Type de document :
Article dans une revue
Finite Fields and Their Applications, Elsevier, 2017, 45, pp.19--42. 〈10.1016/j.ffa.2016.11.009〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01412487
Contributeur : Pascale Charpin <>
Soumis le : lundi 12 décembre 2016 - 14:21:05
Dernière modification le : jeudi 26 avril 2018 - 10:28:07
Document(s) archivé(s) le : lundi 27 mars 2017 - 19:26:59

Fichier

translator_main_FFA_Final_Nov1...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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

Partager

Métriques

Consultations de la notice

234

Téléchargements de fichiers

59