On the complexity of the normal bases via prime Gauss period over finite fields |
| |
Authors: | Qunying Liao Keqin Feng |
| |
Affiliation: | (1) College of Mathematics and Software Science, Sichuan Normal University, Chengdu, 610066, China;(2) Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China |
| |
Abstract: | A formula on the complexity of the normal bases generated by prime Gauss period over finite fields is presented in terms of cyclotomic numbers. Then, the authors determine explicitly the complexity of such normal bases and their dual bases in several cases where the related cyclotomic numbers have been calculated. Particularly, the authors ˉnd several series of such normal bases with low complexity. This research is supported by the National Fundamental Science Research Program 973 of China under Grant No. 2004 CB3180000 and the State Key Lab. (Information Security) of China. |
| |
Keywords: | Complexity cyclotomic number finite field Gauss period normal basis |
本文献已被 SpringerLink 等数据库收录! |
|