2014
DOI: 10.1016/j.ffa.2013.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Normal bases and primitive elements over finite fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
20
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 23 publications
(20 citation statements)
references
References 13 publications
0
20
0
Order By: Relevance
“…Let m = 5, then ρ(2, m) = 1/5 by Lemma 2.5, and from Inequality (8), we get 18,36,72. For these values of n, we choose the values of d and g listed in Table 2 such that the inequality q n/2 > 6W (d) 2 W (g) 2 S holds and get that (2, n) ∈ Q 2 (2, 2) unless n = 9, 18.…”
Section: Pairsmentioning
confidence: 95%
See 2 more Smart Citations
“…Let m = 5, then ρ(2, m) = 1/5 by Lemma 2.5, and from Inequality (8), we get 18,36,72. For these values of n, we choose the values of d and g listed in Table 2 such that the inequality q n/2 > 6W (d) 2 W (g) 2 S holds and get that (2, n) ∈ Q 2 (2, 2) unless n = 9, 18.…”
Section: Pairsmentioning
confidence: 95%
“…Recently, Liao et al [16] generalized this result to the case where q is any prime power. Kapetanakis [17,18] contributed in this direction by proving the existence of primitive normal pairs α, aα+b cα+d in F q n over F q for q ≥ 23 and n ≥ 17. Anju and R.K. Sharma [19] proved the existence of primitive pairs (α, α 2 + α + 1) in F q n and further showed the existence of primitive pairs (α, α 2 + α + 1) where α is a normal element in F q n over F q .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For the remaining cases, namely q ∈ {23, 25} and 17 ≤ m < 67, we compute c q 0 for each pair and check that Eq. (19) is satisfied for all but 16 pairs (q, m). We explicitly check all the remaining pairs and find that only (23, 24) satisfies s = 2.…”
Section: Proposition 62 Let Q and M Be Such That Mmentioning
confidence: 95%
“…Subsequently, Cohen and Huczynska [3] provided a computer-free proof with the help of sieving techniques. Several generalizations of this have also been investigated [2,4,12,13,14].…”
Section: Introductionmentioning
confidence: 99%