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 comments
Loading...
Problem Recent Solvers3
Suggested Problems
-
Remove all the words that end with "ain"
2688 Solvers
-
Given two arrays, find the maximum overlap
1774 Solvers
-
Getting the absolute index from a matrix
258 Solvers
-
Generate N equally spaced intervals between -L and L
952 Solvers
-
Generate a melodic contour string matrix
67 Solvers
More from this Author63
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
