On arithmetical algorithms over finite fields
Journal of Combinatorial Theory Series A
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Counting irreducible factors of polynomials over a finite field
Discrete Mathematics
Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
A new polynomial factorization algorithm and its implementation
Journal of Symbolic Computation
Fast polynomial factorization over high algebraic extensions of finite fields
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Comparative implementations of Berlekamp's and Niederreiter's polynomial factorization algorithms
FFA '95 Proceedings of the third international conference on Finite fields and applications
Subquadratic-time factoring of polynomials over finite fields
Mathematics of Computation
Modern computer algebra
Factoring high-degree polynomials over f2 with Niederreiter's algorithm on the IBM SP2
Mathematics of Computation
Factoring polynomials over finite fields: a survey
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the second Magma conference
Factoring a binary polynomial of degree over one million
ACM SIGSAM Bulletin
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Random Polynomials and Polynomial Factorization
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
On square-free decomposition algorithms
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Faster multiplication in GF(2)[x]
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Fast arithmetics in Artin-Schreier towers over finite fields
Journal of Symbolic Computation
| Hi-index | 0.00 |
We describe algorithms for polynomial factorization over the binary field F2, and their implementation. They allow polynomials of degree up to 250 000 to be factored in about one day of CPU time, distributing the work on two processors.