Irreducible polynomials over finite fields
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 252-262
- https://doi.org/10.1007/3-540-17179-7_15
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Factoring polynomials and primitive elements for special primesTheoretical Computer Science, 1987
- Factoring sparse multivariate polynomialsJournal of Computer and System Sciences, 1985
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- Factoring multivariate polynomials over finite fieldsJournal of Computer and System Sciences, 1985
- Factorization of multivariate polynomials over finite fieldsMathematics of Computation, 1985
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- An average type result on the number of primes satisfying generalized Wieferich conditionProceedings of the Japan Academy, Series A, Mathematical Sciences, 1981
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)Information Processing Letters, 1980
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970