r is the primitive nth root of unity iff there are not other numbers k divide n such that .
Use NthRootOfUnity
function to generate the primitive nth root of unity.
NOTE: In my design, modulus must be prime.
Implement NTT algorithm under ideal.