On finding primitive roots in finite fields

Igor Shparlinski

doi:10.1016/0304-3975(95)00164-6

On finding primitive roots in finite fields

Igor Shparlinski^*

^*Corresponding author for this work

School of Computing

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

43 Citations (Scopus)

Abstract

We show that in any finite field double-struck F sign _q a primitive root can be found in time Q(q ^{1, 4+ε}).

Original language	English
Pages (from-to)	273-275
Number of pages	3
Journal	Theoretical Computer Science
Volume	157
Issue number	2
DOIs	https://doi.org/10.1016/0304-3975(95)00164-6
Publication status	Published - 5 May 1996

Access to Document

10.1016/0304-3975(95)00164-6

Cite this

@article{044e45f971224e43937d5be8486165cb,

title = "On finding primitive roots in finite fields",

abstract = "We show that in any finite field double-struck F sign q a primitive root can be found in time Q(q 1, 4+ε).",

author = "Igor Shparlinski",

year = "1996",

month = may,

day = "5",

doi = "10.1016/0304-3975(95)00164-6",

language = "English",

volume = "157",

pages = "273--275",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - On finding primitive roots in finite fields

AU - Shparlinski, Igor

PY - 1996/5/5

Y1 - 1996/5/5

N2 - We show that in any finite field double-struck F sign q a primitive root can be found in time Q(q 1, 4+ε).

AB - We show that in any finite field double-struck F sign q a primitive root can be found in time Q(q 1, 4+ε).

UR - https://www.scopus.com/pages/publications/0030570118

U2 - 10.1016/0304-3975(95)00164-6

DO - 10.1016/0304-3975(95)00164-6

M3 - Article

AN - SCOPUS:0030570118

SN - 0304-3975

VL - 157

SP - 273

EP - 275

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -

On finding primitive roots in finite fields

Abstract

Access to Document

Other files and links

Fingerprint

Cite this