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

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

从有限域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.