Orders of Gauss periods in finite fields

DOI10.1007/s002000050093zbMath0931.11057WikidataQ56144517 ScholiaQ56144517MaRDI QIDQ1389144

Joachim von zur Gathen, Igor E. Shparlinski

Publication date: 12 August 1998

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050093

zbMATH Keywords

algorithms; finite fields; normal bases; Artin's conjecture; primitive roots in finite fields

Mathematics Subject Classification ID

11Y16: Number-theoretic algorithms; complexity

11T30: Structure theory for finite fields and commutative rings (number-theoretic aspects)

Related Items

Gauss periods: orders and cryptographical applications, Unnamed Item, On the multiplicative orders of \(\gamma\) and \(\gamma+\gamma^{-1}\) over finite fields, Elements of high order in Artin-Schreier extensions of finite fields \(\mathbb{F}_q\), Gauss periods as constructions of low complexity normal bases, Finite field elements of high order arising from modular curves, Efficient polynomial time algorithms computing industrial-strength primitive roots, Algorithms for exponentiation in finite fields, Sharpening of the explicit lower bounds for the order of elements in finite field extensions based on cyclotomic polynomials, Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields, Generating sets for the multiplicative groups of algebras over finite fields and expander graphs, On the construction of finite field elements of large order, SUM–PRODUCT ESTIMATES AND MULTIPLICATIVE ORDERS OFγANDγ+γ⁻¹IN FINITE FIELDS, MULTIPLICATIVE ORDER OF GAUSS PERIODS