On primitive and free roots in a finite field
DOI10.1007/BF01387196zbMATH Open0766.11049MaRDI QIDQ1201337FDOQ1201337
Authors: Dirk Hachenberger 
Publication date: 17 January 1993
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Recommendations
recursive algorithmfinite fieldprimitive element\(\pi\)-polynomialselements of additive and multiplicative ordersfree rootprimitive normal basis generators
Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Primitive Normal Bases for Finite Fields
- Bases for Finite Fields
- Primitive Roots in a Finite Field
- Primitive elements and polynomials with arbitrary trace
- Title not available (Why is that?)
- Optimal normal bases in \(GF(p^ n)\)
- Arithmetic operations in \(GF(2^ m)\)
- On primitive polynomials over finite fields
Cited In (11)
- On Minimal Sets of Generators for Primitive Roots
- A Simple Slide Rule for Finite Fields
- Title not available (Why is that?)
- On explicit relations between cyclotomic numbers
- On Constructing Primitive Roots in Finite Fields With Advice
- On consecutive primitive \(n\)th roots of unity modulo \(q\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic existence results for primitive completely normal elements in extensions of Galois fields
- Primitive Normal Polynomials Over Finite Fields
- Power Roots of Linearized Polynomials
This page was built for publication: On primitive and free roots in a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201337)
