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
-
Back to basics 22 - Rotate a matrix
939 Solvers
-
Getting the indices from a vector
12330 Solvers
-
117 Solvers
-
Join Strings with Multiple Different Delimiters
229 Solvers
-
How long do each of the stages of the rocket take to burn?
557 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!
