@inproceedings{7d300115ee6344ba8518c4ee4d9592a6,
title = "Orders of gauss periods in finite fields",
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.",
author = "{von zur Gathen}, Joachim and Igor Shparlinski",
year = "1995",
month = dec,
doi = "10.1007/BFb0015425",
language = "English",
isbn = "3540605738",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Springer Nature",
pages = "208--215",
editor = "John Staples and Peter Eades and Naoki Katoh and Alistair Moffat",
booktitle = "Algorithms and Computations",
address = "United States",
note = "6th International Symposium on Algorithms and Computations, ISAAC - 1995 ; Conference date: 04-12-1995 Through 06-12-1995",
}