Mathematics of Computation

Author(s): G. J. van der Heiden.
Journal: Math. Comp. 73 (2004), 317-322.
MSC (2000): Primary 11G09, 13P05
Posted: August 7, 2003
Addenda: Math. Comp. 73 (2004), 2109.
Retrieve article in: PDF DVI PostScript

Abstract: In the following, we describe a way of factoring polynomials in $\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.

[Coh93]: H. Cohen.
A course in computational algebraic number theory.
Springer-Verlag, Berlin, 1993. MR 94i:11105
[CZ81]: D.G. Cantor and H. Zassenhaus.
A new algorithm for factoring polynomials over finite fields.
Math. Comp., 36(154):587-592, 1981. MR 82e:12020
[LN97]: R. Lidl and H. Niederreiter.
Finite fields.
Cambridge University Press, Cambridge, second edition, 1997.
With a foreword by P. M. Cohn. MR 97i:11115
[Mat97]: B. H. Matzat.
Introduction to drinfeld modules.
In Drinfeld modules, modular schemes and applications (Alden-Biesen, 1996), pages 3-16. World Sci. Publishing, River Edge, NJ, 1997. MR 99i:11045
[Rei61]: I. Reiner.
On the number of matrices with given characteristic polynomial.
Illinois J. Math., 5:324-329, 1961. MR 25:3053

			Journals Home Search Author Info Subscribe Tech Support Help
ISSN 1088-6842(e) ISSN 0025-5718(p)

Previous issue \| Table of contents \| Next issue Articles in press \| Recently posted articles \| Most recent issue \| All issues Previous Article \| Next Article


	Comments: webmaster@ams.org © Copyright 2008, American Mathematical Society Privacy Statement		Search the AMS