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
15688 Solvers
-
2193 Solvers
-
Given two arrays, find the maximum overlap
1653 Solvers
-
73 Solvers
-
Tony's trick for duplicating an mx1 vector n times
55 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!