Permutation polynomials over finite fields from low-degree rational functions
Cryptography and Security
2025-08-25 v3 Number Theory
Abstract
This paper considers permutation polynomials over the finite field in even characteristic by utilizing low-degree permutation rational functions over . As a result, we obtain two classes of permutation binomials and six classes of permutation pentanomials over . Additionally, we show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature.
Keywords
Cite
@article{arxiv.2503.20982,
title = {Permutation polynomials over finite fields from low-degree rational functions},
author = {Kirpa Garg and Sartaj Ul Hasan and Chunlei Li and Hridesh Kumar and Mohit Pal},
journal= {arXiv preprint arXiv:2503.20982},
year = {2025}
}
Comments
32 pages