An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
- 20 October 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (2) , 94-95
- https://doi.org/10.1016/0020-0190(80)90011-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970