On Inverses of Permutation Polynomials of Small Degree Over Finite Fields

From MaRDI portal
Publication:5211642

DOI10.1109/TIT.2019.2939113zbMATH Open1434.11230arXiv1812.06768MaRDI QIDQ5211642FDOQ5211642


Authors: Yanbin Zheng, Qiang Wang, Wenhong Wei Edit this on Wikidata


Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Permutation polynomials (PPs) and their inverses have applications in cryptography, coding theory and combinatorial design theory. In this paper, we make a brief summary of the inverses of PPs of finite fields, and give the inverses of all PPs of degree leq6 over finite fields mathbbFq for all q and the inverses of all PPs of degree 7 over mathbbF2n. The explicit inverse of a class of fifth degree PPs is the main result, which is obtained by using Lucas' theorem, some congruences of binomial coefficients, and a known formula for the inverses of PPs of finite fields.


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




Recommendations





Cited In (16)





This page was built for publication: On Inverses of Permutation Polynomials of Small Degree Over Finite Fields

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