Factoring polynomials over finite fields with Drinfeld modules
G.J. van der Heiden · Mathematics of Computation · 2003
In the following, we describe a way of factoring polynomials in F q [ X ] \mathbb {F}_q[X] with Drinfeld modules. We furthermore analyse the complexity of the algorithm and compare it to the well-known Cantor-Zassenhaus algorithm.