Font Size: a A A

On Primitive Normal Elements Over Finite Fields

Posted on:2007-07-15Degree:MasterType:Thesis
Country:ChinaCandidate:T TianFull Text:PDF
GTID:2120360212475693Subject:Cryptography
Abstract/Summary:PDF Full Text Request
Let q be a prime power, n a positive integer and Fqn a finite field with qn elements. In the thesis, given a, b∈Fq* we study whether there exists an element ζ in Fqn which satisfies following two or three conditions:(1) ζ is a primitive element in Fqn;(2) both ζ and ζ-1 are normal elements of Fqn over Fq, i.e., both {ζ, ζq,...,ζqn-1}and{ζ-1,ζ-q,...,ζ-q(n-1)} are basis over Fq.(3) TrFqn/fq(ζ) =a and TrFqn/fq(ζ-1)=bAn element ζ in Fqn is called a primitive nomal element over Fq if it is a primitive element in Fqn as well as a nomal element of Fqn over Fq. In Section 2 and Section 3 of Chapter 2, we respectively prove that1. If n ≥ 32, then for any prime power q, there exists a primitive normal element ζ of Fqn over Fq such that ζ-1 is also a primitive normal element of Fqn over Fq.2. If n ≥ 32 and (q, n)(?){(2, 45), (2, 63), (3, 32), (3, 40), (7, 48), (9, 40), (19, 36), (37,36), (41,40)}, then for any a, b ∈ Fq*, there exists a primitive normal element ζ of Fqn over Fq such that ζ-1 is also a primitive normal element of Fqn over Fq, TrFqn/fq(ζ)= a and TrFqn/fq(ζ-1)= b.
Keywords/Search Tags:finite fields, primitive element, normal basis, normal element, trace, character sum, primitive normal polynomial
PDF Full Text Request
Related items