Fast Polynomial Factorization and Modular Composition

We obtain randomized algorithms for factoring degree n univariate polynomials over $\mathbb{F}_q$ requiring $O(n^{1.5 + o(1)}\,{\rm log}^{1+o(1)} q+ n^{1 + o(1)}\,{\rm log}^{2+o(1)} q)$ bit operations. When ${\rm log}\, q < n$, this is asymptotically faster than the best previous algorithms [J. v...

Full description

Bibliographic Details
Main Authors: Kedlaya, Kiran S. (Contributor), Umans, Christopher (Author)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2012-07-24T20:22:30Z.
Subjects:
Online Access:Get fulltext