A C implementation of Niederreiter's algorithm for factoring polynomials over F 2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain ...
We study the factorization into irreducibles of iterates of a quadratic polynomial f over a finite field. We call f settled when the factorization of its nth iterate for large n is dominated by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback