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
-
13637 Solvers
-
Back to basics 23 - Triangular matrix
1135 Solvers
-
30 Solvers
-
Return the first and last characters of a character array
12226 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
400 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!
