You can use the Prime-factor FFT algorithm recursively, since $$100 = 5 \cdot 5 \cdot 2 \cdot 2$$, you only have to implement the radix-5 and radix-2 reductions.