2021
DOI: 10.29020/nybg.ejpam.v14i1.3898
|View full text |Cite
|
Sign up to set email alerts
|

Note on Irreducible Polynomials over Finite Field

Abstract: In this note we extend an irreducibility criterion of polynomial over finite fields. Weprove the irreducibility of the polynomial P(Y ) = Yn + λn−1Y n−1 + λn−2Y n−2 + · · · + λ1Y + λ0, such that λ0 6= 0, deg λn−2 = 2 deg λn−1 + l deg λi, for all i 6= n − 2 and odd integer l.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…This result was the starting point for many researches and the exploration of new criterions, see [1,3]. For older results, see [4,5].…”
Section: Introductionmentioning
confidence: 88%
“…This result was the starting point for many researches and the exploration of new criterions, see [1,3]. For older results, see [4,5].…”
Section: Introductionmentioning
confidence: 88%
“…The first step in constructing the S-box is to find the inverse multiplication of each element in the 𝐺𝐹 (2 8 ). Mathematically, an inverse calculation of an element of an irreducible polynomial can be done using the Extended Euclid Algorithm [18].…”
Section: S-box Construction On 𝑮𝑭(𝟐 𝟖 )mentioning
confidence: 99%