Elements of provable high orders in finite fields

被引：39

作者：

Gao, SH ^{[1
]}

机构：

[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA

来源：

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 1999年 / 127卷 / 06期

关键词：

finite fields; primitive elements; elements of provable high orders; compositions of polynomials;

D O I：

10.1090/S0002-9939-99-04795-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A method is given for constructing elements in F(q)n whose orders are larger than any polynomial in n when n becomes large. As a by-product a theorem on multiplicative independence of compositions of polynomials is proved.

引用

页码：1615 / 1623

页数：9

共 15 条

[1] Comments on search procedures for primitive roots [J].

Bach, E .

MATHEMATICS OF COMPUTATION, 1997, 66 (220) :1719-1727

[2]

Gao S., 1992, Designs, Codes and Cryptography, V2, P315, DOI 10.1007/BF00125200

[3]

GAO S, 1997, GAUSS PERIODS GROUPS

[4]

GAO SH, 1995, LECT NOTES COMPUT SC, V911, P311

[5] ON ORDERS OF OPTIMAL NORMAL BASIS GENERATORS [J].

GAO, SH ;

VANSTONE, SA .

MATHEMATICS OF COMPUTATION, 1995, 64 (211) :1227-1233

[6] Gauss periods: Orders and cryptographical applications [J].

Gao, SH ;

Von zur Gathen, J ;

Panario, D .

MATHEMATICS OF COMPUTATION, 1998, 67 (221) :343-352

[7]

Lidl R., 1983, FINITE FIELDS

[8]

Menezes A. J., 1993, APPL FINITE FIELDS

[9]

MULLIN RC, 1988, DISCRETE APPLIED MAT, V22, P149

[10] SEARCHING FOR PRIMITIVE ROOTS IN FINITE-FIELDS [J].

SHOUP, V .

MATHEMATICS OF COMPUTATION, 1992, 58 (197) :369-380

← 1 2 →