FINDING IRREDUCIBLE AND PRIMITIVE POLYNOMIALS

被引:8
作者
SHPARLINSKI, IE
机构
[1] School of MPCE, Macquarie University, 2109, NSW
关键词
ALGORITHMS IN FINITE FIELDS; POLYNOMIALS OVER FINITE FIELDS;
D O I
10.1007/BF01200150
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In the paper some new fast constructions of irreducible and primitive polynomials are presented. For instance, it is shown, that for any Q large enough one can design a finite field F(q) with q = Q + o(Q) elements in polynomial time (log Q)O(1).
引用
收藏
页码:263 / 268
页数:6
相关论文
共 18 条
[1]  
ADELMAN L, 1986, 18TH P ANN ACM S THE, P350
[2]  
BABAEV G, 1966, DISTRIBUTION INTEGER
[3]  
BACH E, 1990, ANN REV COMP SCI, V4, P119
[4]  
CHISTOV AL, 1984, 7TH ALL UN C MATH LO, P196
[5]  
COHEN SD, 1991, 9165 GLASG U PREPR, P1
[6]  
COOHEN SD, 1991, 9171 GLASG U PREPR, P1
[7]  
EVDOKIMOV SA, 1989, ZAP NAUCHN SEM LENIN, V176, P104
[8]  
Lidl Rudolf, 1983, FINITE FIELDS
[9]  
Macwilliams F. J., 1977, THEORY ERROR CORRECT
[10]  
Semaev I. A., 1988, MAT SBORNIK, V135, P520