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
-
263 Solvers
-
288 Solvers
-
Pythagorean perfect squares: find the square of the hypotenuse and the length of the other side
53 Solvers
-
Put two time series onto the same time basis
321 Solvers
-
Find nearest prime number less than input number
700 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!