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 Solvers4
Suggested Problems
-
2121 Solvers
-
Return the first and last characters of a character array
12596 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
279 Solvers
-
Moving average (variable kernel length)
139 Solvers
-
Implement a bubble sort technique and output the number of swaps required
404 Solvers
More from this Author65
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!