Constructing Normal Bases in Nite Elds

@inproceedings{Gathen1990ConstructingNB,
  title={Constructing Normal Bases in Nite Elds},
  author={Joachim von zur Gathen and Mark Giesbrecht},
  year={1990}
}
An eecient probabilistic algorithm to nd a normal basis in a nite eld is presented. It can, in fact, nd an element of arbitrary prescribed additive order. It is based on a density estimate for normal elements. A similar estimate yields a probabilistic polynomial-time reduction from nding primitive normal elements to nding primitive elements. 

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Finding isomorphisms between nite elds

  • H. W. Lenstra
  • 1989
Highly Influential
10 Excerpts

Algebra, Erster Teil

  • B. L. van der Waerden
  • Springer-Verlag (Berlin),
  • 1966
Highly Influential
2 Excerpts

On normal bases of a nite eld

  • V. M. Sidel'nikov
  • Math. USSR Sbornik
  • 1988
1 Excerpt

Bases for nite elds

  • H. Davenport
  • J. London Math. Soc
  • 1968
1 Excerpt

Contributions to the theory of nite elds

  • O. Ore
  • Trans. Amer. Math. Soc
  • 1934
2 Excerpts

Similar Papers

Loading similar papers…