,
, and 
with coefficients in a prime finite field, we
present a new algorithm for computing 
modulo in time close to
linear and with an asymptotic complexity smaller than the one of the
Kedlaya–Umans algorithm. As a novelty, our method mostly performs
fast floating point Fourier transforms, while previously known ones rely
on ad hoc algebraic constructions of finite fields.