Problem 46761. Inverse Number Theoretic Transform (iNTT)
Given an input polynomial (rhat) of length n that has been Number Theoretic Transformed (NTT) modulo p, a prime number using it's primitive nth root of unity as the generator for the inverse tweedle factors, convert the polynominal coefficents by Inverse Number Theoretic Transform (iNTT) mod p back into the original polynomial coefficents.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers1
Suggested Problems
-
Count from 0 to N^M in base N.
235 Solvers
-
133 Solvers
-
467 Solvers
-
418 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
531 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!