Finding Isomorphisms Between Finite Fields
- 1 January 1991
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 56 (193), 329-347
- https://doi.org/10.2307/2008545
Abstract
We show that an isomorphism between two explicitly given finite fields of the same cardinality can be exhibited in deterministic polynomial time.Keywords
This publication has 5 references indexed in Scilit:
- New Algorithms for Finding Irreducible Polynomials Over Finite FieldsMathematics of Computation, 1990
- Primitive Normal Bases for Finite FieldsMathematics of Computation, 1987
- Factorization of polynomialsACM SIGSAM Bulletin, 1984
- Primality Testing and Jacobi SumsMathematics of Computation, 1984
- A doubly-infinite system of simple groupsBulletin of the American Mathematical Society, 1893