Portal de Periódicos da CAPES

Polynomial factorization over ${\mathbb F}_2$

2002; American Mathematical Society; Volume: 71; Issue: 240 Linguagem: Inglês

10.1090/s0025-5718-02-01421-7

1088-6842

Joachim von zur Gathen, Jürgen Gerhard,

Polynomial and algebraic computation

We describe algorithms for polynomial factorization over the binary field ${\mathbb F}_2$, 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.