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
-
Sum all integers from 1 to 2^n
16660 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
547 Solvers
-
Sort numbers by outside digits
154 Solvers
-
Matrix indexing with two vectors of indices
751 Solvers
-
67 Solvers
More from this Author57
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!