v.0.1.6

We extend the NTT to the case of non prime power moduli. We require that n divide p-1 for each prime factor p of the given modulus.

This ensures we can compute an n^th root of unity mod modulus by computing n^th roots for each factor p^k and pulling them back using the Chinese remainder theorem.