MULTIPLICATIVE ORDER OF GAUSS PERIODS

被引：21

作者：

Ahmadi, Omran ^{[1
]}

Shparlinski, Igor E. ^{[2
]}

Voloch, Jose Felipe ^{[3
]}

机构：

[1] Univ Coll Dublin, Claude Shannon Inst, Dublin 4, Ireland

[2] Macquarie Univ, Dept Comp, Sydney, NSW 2109, Australia

[3] Univ Texas Austin, Dept Math, Austin, TX 78712 USA

来源：

INTERNATIONAL JOURNAL OF NUMBER THEORY | 2010年 / 6卷 / 04期

关键词：

Finite fields; multiplicative order; Gauss period; partition; FINITE-FIELD ELEMENTS; NORMAL BASES;

D O I：

10.1142/S1793042110003290

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of von zur Gathen and Shparlinski.

引用

页码：877 / 882

页数：6

共 23 条

[1]

Ahmadi O, 2007, LECT NOTES COMPUT SC, V4547, P85

[2]

Andrews G.E., 1976, THEORY PARTITIONS

[3]

[Anonymous], 1951, Quart. J. Math. Oxford Ser.

[4]

[Anonymous], 1953, Quart. J. Math.

[5] LOW COMPLEXITY NORMAL BASES [J].

ASH, DW ;

BLAKE, IF ;

VANSTONE, SA .

DISCRETE APPLIED MATHEMATICS, 1989, 25 (03) :191-210

[6]

BERNSTEIN DJ, 2005, J THEOR NOMBR BORDX, V17, P721

[7]

BLAKE IF, 1993, APPL FINITE FIELDS

[8] Finite field elements of high order arising from modular curves [J].

Burkhart, Jessica F. ;

Calkin, Neil J. ;

Gao, Shuhong ;

Hyde-Volpe, Justine C. ;

James, Kevin ;

Maharaj, Hiren ;

Manber, Shelly ;

Ruiz, Jared ;

Smith, Ethan .

DESIGNS CODES AND CRYPTOGRAPHY, 2009, 51 (03) :301-314

[9] On the construction of finite field elements of large order [J].

Cheng, Q .

FINITE FIELDS AND THEIR APPLICATIONS, 2005, 11 (03) :358-366

[10] Normal bases via general Gauss periods [J].

Feisel, S ;

Von zur Gathen, J ;

Shokrollahi, MA .

MATHEMATICS OF COMPUTATION, 1999, 68 (225) :271-290

← 1 2 3 →