Normal bases via general Gauss periods
From MaRDI portal
Publication:4223138
DOI10.1090/S0025-5718-99-00988-6zbMath0922.11103OpenAlexW1978030427MaRDI QIDQ4223138
Joachim von zur Gathen, Sandra Feisel, Mohammad Amin Shokrollahi
Publication date: 14 December 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-99-00988-6
Symbolic computation and algebraic computation (68W30) Separable extensions, Galois theory (12F10) Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Cyclotomic extensions (11R18) Cyclotomy (11T22)
Related Items (14)
Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ On design of circuits of logarithmic depth for inversion in finite fields ⋮ Computing special powers in finite fields ⋮ Fast arithmetic with general Gauß periods ⋮ Complexity of computation in finite fields ⋮ Low complexity of a class of normal bases over finite fields ⋮ Computing isomorphisms and embeddings of finite fields ⋮ A method for constructing a self-dual normal basis in odd characteristic extension fields ⋮ Abelian groups, Gauss periods, and normal bases ⋮ MULTIPLICATIVE ORDER OF GAUSS PERIODS ⋮ On the complexity of the normal bases via prime Gauss period over finite fields ⋮ On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other ⋮ Normal bases and their dual-bases over finite fields ⋮ A density of ramified primes
This page was built for publication: Normal bases via general Gauss periods
