Complete Characterization of a Class of Permutation Trinomials in Characteristic Five
Loading...
Date
2024
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Open Access Color
HYBRID
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Top 10%
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. © The Author(s) 2024.
Description
Keywords
11T71, 12E10, Absolutely irreducible, Finite fields, MSC 11T06, Permutation polynomials, permutation polynomials, finite fields, 510, absolutely irreducible, Algebraic coding theory; cryptography (number-theoretic aspects), Special polynomials in general fields, Polynomials over finite fields
Turkish CoHE Thesis Center URL
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
Q2
Scopus Q
Q3
OpenCitations Citation Count
N/A
Source
Cryptography and Communications
Volume
16
Issue
4
Start Page
825
End Page
841
Collections
PlumX Metrics
Citations
Scopus : 3
SCOPUS™ Citations
3
checked on Jan 25, 2026
Page Views
5
checked on Jan 25, 2026
Downloads
139
checked on Jan 25, 2026
Google Scholar™
