有限域上I-型最优正规基对偶基复杂度的新证明(英文)  

A new proof to the complexity of the dual basis of a type-I optimal normal basis over finite fields

作　　者：吴保峰[1] 周凯[1] 刘卓军[1] 

机构地区：[1]中国科学院数学与系统科学研究院数学机械化实验室,北京100190

出　　处：《中国科学院大学学报（中英文）》2014年第5期586-589,共4页Journal of University of Chinese Academy of Sciences

基　　金：Supported by National Basic Research Program of China(2011CB302400);National Natural Science Foundation of China(11301509)

摘　　要：万哲先和周凯于2007年确定出有限域Fqn上I-型最优正规基对偶基的复杂度在q为偶数和奇数的情况分别为3n-3和3n-2.我们通过利用关于有限域多项式基对偶基的一个引理,更清晰地求出I-型最优正规基的对偶基,从而给出其复杂度的一个新证明.The complexity of the dual basis of a type-I optimal normal basis of Fqnover Fqwas determined to be 3n- 3 or 3n- 2 according as q is even or odd,respectively,by Wan and Zhou in 2007. We give a new proof to this result by clearly deriving the dual of a type-I optimal normal basis with the aid of a lemma on the dual of a polynomial basis.

关 键 词：最优正规基 对偶基 复杂度 多项式基 

分 类 号：O153[理学—数学]