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
-
Find the numeric mean of the prime numbers in a matrix.
9047 Solvers
-
Poker Series 11: selectBestHand
35 Solvers
-
Set the array elements whose value is 13 to 0
1404 Solvers
-
237 Solvers
-
Area of Triangle with Oblique Coordinates
11 Solvers
More from this Author57
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!