Orders of gauss periods in finite fields

Joachim von zur Gathen, Igor Shparlinski

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

12 Citations (Scopus)

Abstract

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

Original languageEnglish
Title of host publicationAlgorithms and Computations
Subtitle of host publication6th International Symposium, ISAAC '95 Cairns, Australia, December 4–6, 1995 Proceedings
EditorsJohn Staples, Peter Eades, Naoki Katoh, Alistair Moffat
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Pages208-215
Number of pages8
ISBN (Electronic)9783540477662
ISBN (Print)3540605738, 9783540605737
DOIs
Publication statusPublished - Dec 1995
Event6th International Symposium on Algorithms and Computations, ISAAC - 1995 - Cairns, Australia
Duration: 4 Dec 19956 Dec 1995

Publication series

NameLecture Notes in Computer Science
Volume1004
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Symposium on Algorithms and Computations, ISAAC - 1995
Country/TerritoryAustralia
CityCairns
Period4/12/956/12/95

Fingerprint

Dive into the research topics of 'Orders of gauss periods in finite fields'. Together they form a unique fingerprint.

Cite this