VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
Irreducibility of multivariate polynomials
Journal of Computer and System Sciences
Finding irreducible polynomials over finite fields
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Riemann hypothesis and finding roots over finite fields
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Architectures for exponentiation in GF (2n)
Proceedings on Advances in cryptology---CRYPTO '86
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the deterministic complexity of factoring polynomials over finite fields
Information Processing Letters
On Structure Complexity of Normal Basis of Finite Field
FCT '87 Proceedings of the International Conference on Fundamentals of Computation Theory
A Cellular-Array Multiplier for GF(2m)
IEEE Transactions on Computers
Fast management of permutation groups
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Finding (good) normal bases in finite fields
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Finite Fields and Their Applications
On the Density of Normal Bases in Finite Fields
Finite Fields and Their Applications
| Hi-index | 0.00 |
An efficient probabilistic algorithm to find a normal basis in a finite field is presented. It can, in fact, find 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 finding primitive normal elements to finding primitive elements.