FINDING IRREDUCIBLE AND PRIMITIVE POLYNOMIALS

被引：8

作者：

SHPARLINSKI, IE

机构：

[1] School of MPCE, Macquarie University, 2109, NSW

来源：

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 1993年 / 4卷 / 04期

关键词：

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