Two New Classes of Complete Permutation Polynomials Over Finite Fields 𝔽33n
International Journal of Foundations of Computer Science · 23.05.2026 · 1-18
DOI: 10.1142/s0129054126500152 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Foundations of Computer Science, online erschienen am 23.05.2026. Verfasst von Rajesh P. Singh und 2 weiteren Autor:innen. Gefördert von: DST, Government of India.
Abstract (Originalsprache)
In this paper, we investigate two classes of complete permutation polynomials over finite fields [Formula: see text]. The first class of complete permutation polynomial is of the form [Formula: see text]. In this class, for a fixed [Formula: see text], we find four values of [Formula: see text] [Formula: see text] for which [Formula: see text] is a complete permutation polynomial over [Formula: see text] for every polynomial [Formula: see text]. The second class of complete permutation polynomial is of the form [Formula: see text]. We characterize this class for several specific values of [Formula: see text] and [Formula: see text].
Förderung
- DST, Government of India
Zitieren
APA
Singh, R. P., Prakash, J., & Kumar, D. (2026). Two New Classes of Complete Permutation Polynomials Over Finite Fields 𝔽33n. International Journal of Foundations of Computer Science, 1-18. https://doi.org/10.1142/s0129054126500152
Vancouver
Singh RP, Prakash J, Kumar D. Two New Classes of Complete Permutation Polynomials Over Finite Fields 𝔽33n. International Journal of Foundations of Computer Science. 2026:1-18. doi:10.1142/s0129054126500152
BibTeX
@article{Singh2026,
author = {Singh, Rajesh P. and Prakash, Jitendra and Kumar, Dinesh},
title = {Two New Classes of Complete Permutation Polynomials Over Finite Fields 𝔽33n},
journal = {International Journal of Foundations of Computer Science},
year = {2026},
pages = {1--18},
doi = {10.1142/s0129054126500152}
}
EUVIMED