Complete characterization of a class of permutation trinomials in characteristic five

Warning The system is temporarily closed to updates for reporting purpose.

Grassl, Markus and Özbudak, Ferruh and Özkaya, Buket and Temür, Burcu Gülmez (2024) Complete characterization of a class of permutation trinomials in characteristic five. Cryptography and Communications, 16 (4). pp. 825-841. ISSN 1936-2447 (Print) 1936-2455 (Online)

This is the latest version of this item.

Full text not available from this repository. (Request a copy)

Abstract

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+λ1x5q+λ2xq+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 F52k.
Item Type: Article
Uncontrolled Keywords: 11T71; 12E10; Absolutely irreducible; Finite fields; MSC 11T06; Permutation polynomials
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Ferruh Özbudak
Date Deposited: 23 Sep 2024 14:31
Last Modified: 23 Sep 2024 14:31
URI: https://research.sabanciuniv.edu/id/eprint/50051

Available Versions of this Item

Actions (login required)

View Item
View Item