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
-
Return a list sorted by number of occurrences
2830 Solvers
-
Find the peak 3n+1 sequence value
2537 Solvers
-
974 Solvers
-
652 Solvers
-
Triangular Tiling Dots in a Circle
30 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!