Composition modulo powers of polynomials
[ Homepage | Publications | Talks | TeXmacs | Mathemagix ]


Modular composition is the problem to compose two univariate polynomials modulo a third one. For polynomials with coefficients in a finite field, Kedlaya and Umans proved in 2008 that the theoretical bit complexity for performing this task could be made arbitrarily close to linear. Unfortunately, beyond its major theoretical impact, this result has not led to practically faster implementations yet. In this paper, we study the more specific case of composition modulo the power of a polynomial. First we extend previously known algorithms for power series composition to this context. We next present a fast direct reduction of our problem to power series composition.

Authors: Joris van der Hoeven, Grégoire Lecerf

Keywords: modular composition, series composition, algorithm, complexity

View: Html, TeXmacs, Pdf, BibTeX