Complete Characterization of a Class of Permutation Trinomial in Characteristic Five

2024-02-01
Grassl, Markus
Özbudak, Ferruh
Özkaya, Buket
Gülmez Temür, Burcu
In this paper, we address an open problem posed by Bai and Xia in [2]. We study polynomials of the form f (x) = x4q+1 + λ1 x5q + λ2 x q+4 over the finite field F5k , which are not quasi- multiplicative equivalent to any of the known permutation polynomials in the literature. We find necessary and sufficient conditions on λ1, λ2 ∈ F5k so that f (x) is a permutation monomial, binomial, or trinomial of F5 2k .
CRYPTOGRAPHY AND COMMUNICATIONS
Citation Formats
M. Grassl, F. Özbudak, B. Özkaya, and B. Gülmez Temür, “Complete Characterization of a Class of Permutation Trinomial in Characteristic Five,” CRYPTOGRAPHY AND COMMUNICATIONS, pp. 1–1, 2024, Accessed: 00, 2024. [Online]. Available: https://hdl.handle.net/11511/108596.