Finding irreducible and primitive polynomials
- 1 December 1993
- journal article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 4 (4) , 263-268
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The explicit construction of irreducible polynomials over finite fieldsDesigns, Codes and Cryptography, 1992
- Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesisJournal of Mathematical Sciences, 1992
- ON PRIMITIVE ELEMENTS IN FINITE FIELDS AND ON ELLIPTIC CURVESMathematics of the USSR-Sbornik, 1992
- Factoring1991
- Number-Theoretic AlgorithmsAnnual Review of Computer Science, 1990
- New algorithms for finding irreducible polynomials over finite fieldsMathematics of Computation, 1990
- Searching for primitive roots in finite fields1990
- Irreducible polynomials over finite fieldsLecture Notes in Computer Science, 1986
- Finding irreducible polynomials over finite fields1986
- Topics in Multiplicative Number Theory1971