A new proof to the complexity of the dual basis of a type I optimal normal basis

Details A new proof to the complexity of the dual basis of a type I optimal normal basis A new proof to the complexity of the dual basis of a type I optimal normal basis

2011-12-14

arxiv.org/abs/1112.3153v2

Computer Science

Discrete Mathematics

5 pages

Scientific paper

The complexity of the dual basis of a type I optimal normal basis of
$\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$ was determined to be $3n-3$ or $3n-2$
according as $q$ is even or odd, respectively, by Z.-X. Wan and K. Zhou in
2007. We give a new proof to this result by clearly deriving the dual of a type
I optimal basis with the aid of a lemma on the dual of a polynomial basis.

Affiliated with

Also associated with

No associations

Rating

A new proof to the complexity of the dual basis of a type I optimal normal basis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new proof to the complexity of the dual basis of a type I optimal normal basis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new proof to the complexity of the dual basis of a type I optimal normal basis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-225990