On a type of permutation rational functions over finite fields

From MaRDI portal
Publication:1994976

DOI10.1016/J.FFA.2020.101758zbMATH Open1456.11219arXiv1910.11989OpenAlexW3088569448MaRDI QIDQ1994976FDOQ1994976


Authors: Christopher Sze, Xiang-Dong Hou Edit this on Wikidata


Publication date: 18 February 2021

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

Abstract: Let p be a prime and n be a positive integer. Let fb(X)=X+(XpX+b)1, where binBbbFpn is such that extTrpn/p(b)e0. In 2008, Yuan et al. cite{Yuan-Ding-Wang-Pieprzyk-FFA-2008} showed that for p=2,3, fb permutes BbbFpn for all nge1. Using the Hasse-Weil bound, we show that when p>3 and nge5, f does not permute BbbFpn. For p>3 and n=2, we prove that fb permutes BbbFp2 if and only if extTrp2/p(b)=pm1. We conjecture that for p>3 and n=3,4, fb does not permute BbbFpn.


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




Recommendations




Cites Work


Cited In (18)





This page was built for publication: On a type of permutation rational functions over finite fields

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