Sage GSoC

Sometimes it is very helpful to have a function which makes an automatic choice between available factorisation algorithms depending on an ...

Fact.  A polynomial $f\in F_q[x]$ of degree $n\geq 1$ is irreducible if and only if 1) $x^{q^n}\equiv x \mod f$ and 2) $\gcd (x^{q^{n/t}}...

In my previous posts I described the variant of equal-degree splitting for odd prime powers. This algorithm requires some modification for ...

Yesterday I finished porting Berlekamp's algorithm from nmod_poly module to fmpz_mod_poly_factor module. Unlike Cantor-Zassenhaus and...

I wrote in my previous post that Cantor and Zassenhaus' algorithm of polynomial factorisation over finite fields can be divided into th...

Last Saturday I finished the first big part of my project: I ported Cantor-Zassenhaus algorithm with all helper functions from nmod_poly m...

Now I'm working on the second step of porting code for Cantor-Zassenhaus factorisation. It is necessary to move functions for polynomia...