I've seen recently that someone mentioned in in the problem thread of one of the project euler problems that this can actually be done. They said:

Can anyone please point to the algorithm?... and then calculate the exponential function of prepared polynomial (in modulo $x^n$) in $O(n \log n)$ by Newton's method and fast convolution.