Constructing normal bases in finite fields
Authors:
- 1 December 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 10 (6) , 547-570
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- New algorithms for finding irreducible polynomials over finite fieldsMathematics of Computation, 1990
- CONSTRUCTION OF POLYNOMIALS IRREDUCIBLE OVER A FINITE FIELD WITH LINEARLY INDEPENDENT ROOTSMathematics of the USSR-Sbornik, 1989
- Primitive normal bases for finite fieldsMathematics of Computation, 1987
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985
- A Cellular-Array Multiplier for GF(2m)IEEE Transactions on Computers, 1971
- Bases for Finite FieldsJournal of the London Mathematical Society, 1968
- Primitive roots in a finite fieldTransactions of the American Mathematical Society, 1952
- Ueber die Darstellung der Zahlen eines Gattungsbereiches für einen beliebigen Primdivisor.Journal für die reine und angewandte Mathematik (Crelles Journal), 1888
- Lehrsätze.Journal für die reine und angewandte Mathematik (Crelles Journal), 1850