On primitive and free roots in a finite field

DOI10.1007/BF01387196zbMath0766.11049MaRDI QIDQ1201337

Dirk Hachenberger

Publication date: 17 January 1993

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

zbMATH Keywords

finite fieldrecursive algorithmprimitive element\(\pi\)-polynomialselements of additive and multiplicative ordersfree rootprimitive normal basis generators

Mathematics Subject Classification ID

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

Related Items (2)

Asymptotic existence results for primitive completely normal elements in extensions of Galois fields ⋮ Primitive Normal Polynomials Over Finite Fields

Cites Work

• Unnamed Item
• Unnamed Item
• On primitive polynomials over finite fields
• Primitive elements and polynomials with arbitrary trace
• Optimal normal bases in \(GF(p^ n)\)
• Arithmetic operations in \(GF(2^ m)\)
• Primitive Normal Bases for Finite Fields
• Bases for Finite Fields
• Primitive Roots in a Finite Field

This page was built for publication: On primitive and free roots in a finite field