有限域F_p^2上原根计算的改进  

Improvement for Computing Primitive Roots of a Finite Field

作　　者：阮艳华[1] 张露萍[1] 

机构地区：[1]江西蓝天学院复杂生命动力学研究所

出　　处：《江西科技学院学报》2008年第2期24-26,共3页Journal of Jiangxi University of Technology

摘　　要：从有限域Fp的原根出发有一个求域Fp2的原根的算法,这个算法共含有三大步。本文简化了第三步,使得运算量为已有最快算法的2/3或有数量级的减少不等。There is an algorithm for finding primitive roots of a finite field from primitive roots of the finite field.The algorithm contains three main steps.In this article,the author simplifies the third step so that arithmetic labor is two thirds of the fastest algorithm and magnitude-order is reduced.

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

分 类 号：O156.2[理学—数学] O157.4[理学—基础数学]