On finding primitive roots in finite fields
- 1 May 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 157 (2) , 273-275
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Finding irreducible and primitive polynomialsApplicable Algebra in Engineering, Communication and Computing, 1993
- ON PRIMITIVE ELEMENTS IN FINITE FIELDS AND ON ELLIPTIC CURVESMathematics of the USSR-Sbornik, 1992
- Searching for primitive roots in finite fieldsMathematics of Computation, 1992
- Searching for Primitive Roots in Finite FieldsMathematics of Computation, 1992
- Finding isomorphisms between finite fieldsMathematics of Computation, 1991
- Finding Isomorphisms Between Finite FieldsMathematics of Computation, 1991
- New algorithms for finding irreducible polynomials over finite fieldsMathematics of Computation, 1990
- New Algorithms for Finding Irreducible Polynomials Over Finite FieldsMathematics of Computation, 1990
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974
- On Character Sums and Primitive Roots†Proceedings of the London Mathematical Society, 1962