ON THE CONSTRUCTION OF A PRIMITIVE NORMAL BASIS IN A FINITE FIELD

DOI10.1070/SM1990v067n02ABEH001369zbMath0709.11073OpenAlexW2015948546MaRDI QIDQ3491687

Sergei Alexandrovich Stepanov, Igor E. Shparlinski

Publication date: 1990

Published in: Mathematics of the USSR-Sbornik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm1990v067n02abeh001369

zbMATH Keywords

polynomial time algorithmnormal basisprimitive element

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (2)

On the statistical properties of Diffie-Hellman distributions ⋮ On the singularity of generalised Vandermonde matrices over finite fields

This page was built for publication: ON THE CONSTRUCTION OF A PRIMITIVE NORMAL BASIS IN A FINITE FIELD