Orders of Gauss periods in finite fields

Joachim Von Zur Gathen; Igor Shparlinski

Orders of Gauss periods in finite fields

Joachim Von Zur Gathen^*, Igor Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

24 Citations (Scopus)

Abstract

It is shown that Gauss periods of a special type give an explicit polynomial-time computation of elements of exponentially large multiplicative order in some finite fields. This can be considered as a step towards solving the celebrated problem of finding primitive roots in finite fields in polynomial time.

Original language	English
Pages (from-to)	15-24
Number of pages	10
Journal	Applicable Algebra in Engineering, Communications and Computing
Volume	9
Issue number	1
Publication status	Published - Apr 1998

Keywords

Algorithms
Artin's conjecture
Finite fields
Normal bases
Primitive roots

Cite this

@article{a8c6376d67b24378854383cc29d70e07,

title = "Orders of Gauss periods in finite fields",

abstract = "It is shown that Gauss periods of a special type give an explicit polynomial-time computation of elements of exponentially large multiplicative order in some finite fields. This can be considered as a step towards solving the celebrated problem of finding primitive roots in finite fields in polynomial time.",

keywords = "Algorithms, Artin's conjecture, Finite fields, Normal bases, Primitive roots",

author = "{Von Zur Gathen}, Joachim and Igor Shparlinski",

year = "1998",

month = apr,

language = "English",

volume = "9",

pages = "15--24",

journal = "Applicable Algebra in Engineering, Communications and Computing",

issn = "0938-1279",

publisher = "Springer, Springer Nature",

number = "1",

}

TY - JOUR

T1 - Orders of Gauss periods in finite fields

AU - Von Zur Gathen, Joachim

AU - Shparlinski, Igor

PY - 1998/4

Y1 - 1998/4

N2 - It is shown that Gauss periods of a special type give an explicit polynomial-time computation of elements of exponentially large multiplicative order in some finite fields. This can be considered as a step towards solving the celebrated problem of finding primitive roots in finite fields in polynomial time.

AB - It is shown that Gauss periods of a special type give an explicit polynomial-time computation of elements of exponentially large multiplicative order in some finite fields. This can be considered as a step towards solving the celebrated problem of finding primitive roots in finite fields in polynomial time.

KW - Algorithms

KW - Artin's conjecture

KW - Finite fields

KW - Normal bases

KW - Primitive roots

UR - http://www.scopus.com/inward/record.url?scp=0031699237&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031699237

SN - 0938-1279

VL - 9

SP - 15

EP - 24

JO - Applicable Algebra in Engineering, Communications and Computing

JF - Applicable Algebra in Engineering, Communications and Computing

IS - 1

ER -

Orders of Gauss periods in finite fields

Abstract

Keywords

Other files and links

Fingerprint

Cite this