有限域F_(p^2)上原根计算的改进  

Extenstion of Computing Primitive Roots of a Finite Field F_(p^2)

作　　者：阮艳华[1] 陈建华[2] 汪玉[2] 

机构地区：[1]江西蓝天学院复杂生命动力学研究所,江西南昌330098 [2]武汉大学数学与统计学院,湖北武汉430072

出　　处：《湖北民族学院学报（自然科学版）》2008年第2期159-161,共3页Journal of Hubei Minzu University(Natural Science Edition)

基　　金：863计划项目(2001AA141010)

摘　　要：从有限域Fp的原根出发有一个求Fp2的原根的算法,这个算法共含三大步.研究并简化了第三步,使得运算量为已有最快算法的2/3或有数量级的减少不等.There is an algorithm for finding primitive roots of a finite field Fp^2 from primitive roots of the finite field Fp. The algorithm contains three main steps. This paper simplifies the third step which makes the arithmetic labor two thirds of or magnitude - order less than that of addressed fastest third step.

关 键 词：有限域 原根 运算量 

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