Permutations via linear translators

From MaRDI portal
Publication:2396747

DOI10.1016/J.FFA.2016.11.009zbMATH Open1376.12003arXiv1609.09291OpenAlexW2526479025MaRDI QIDQ2396747FDOQ2396747

Pascale Charpin, N. Cepak, E. Pasalic

Publication date: 24 May 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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 charac- terize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [10], 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 is mapped to x+(x^(p^m) - x+ lambda)^s and a few infinite classes of permutations of this form are proposed.


Full work available at URL: https://arxiv.org/abs/1609.09291




Recommendations




Cites Work


Cited In (22)





This page was built for publication: Permutations via linear translators

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