On the complexity of the dual basis of a type I optimal normal basis

被引：10

作者：

Wan, Zhe-Xian ^{[1
]}

Zhou, Kai ^{[1
]}

机构：

[1] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China

来源：

FINITE FIELDS AND THEIR APPLICATIONS | 2007年 / 13卷 / 02期

基金：

中国国家自然科学基金;

关键词：

finite field; normal basis; complexity of a normal basis; type I optimal normal basis; dual bases;

D O I：

10.1016/j.ffa.2005.10.007

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The complexity of the dual of a type I optimal normal basis of F(q)n over F-q is computed to be either 3n - 3 or 3n - 2 according as q is even or odd, respectively. A partial converse of this result is also obtained. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：411 / 417

页数：7