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 Solvers2
Suggested Problems
-
7202 Solvers
-
285 Solvers
-
Return unique values without sorting
897 Solvers
-
Number of 1s in a binary string
8308 Solvers
-
Duplicate each element of a vector.
596 Solvers
More from this Author54
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!