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
-
18446 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1029 Solvers
-
84 Solvers
-
Divisible by n, Truncated-number Divisors
74 Solvers
-
Optimal Asymmetric Encryption Padding decoding of message for RSA Cryptography
3 Solvers
More from this Author56
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!