Fast modular composition using spiroids |
| HomepagePublicationsTalksTeXmacsMathemagix |
Consider three univariate polynomials
,
,
in
, for
some integer
. The problem of
modular composition is to compute the composition
modulo
.
In our talk, we will present a new algorithm for this task, with a
better bit complexity than all previously known algorithms.
Occasion:
Documents: slideshow, TeXmacs source