Factoring polynomials over finite fields with drinfeld modules

  • Authors:

  • G. J. van der Heiden

  • Affiliations:

  • Vakgroep Wiskunde RUG, P.O. Box 800, 9700 AV Groningen, The Netherlands

  • Venue:
  • Mathematics of Computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.02

Visualization

Abstract

In the following, we describe a way of factoring polynomials in Fq[X] with Drinfeld modules. We furthermore analyse the complexity of the algorithm and compare it to the well-known Cantor-Zassenhaus algorithm.