Problem 46696. Number Theoretic Transform (NTT)
Given an input polynomial (r) of length <=n and a prime number (p) such that an nth root of unity exists and the modular inverse of (n) modulus p exists. Convert the polynominal coefficents by Number Theoretic Transform (NTT) using the primitive nth root of unity as the generator mod p.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15776 Solvers
-
Remove all the words that end with "ain"
2632 Solvers
-
Project Euler: Problem 5, Smallest multiple
1647 Solvers
-
Back to basics 9 - Indexed References
459 Solvers
-
Put two time series onto the same time basis
348 Solvers
More from this Author61
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!