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 Solvers3
Suggested Problems
-
Compute a dot product of two vectors x and y
1046 Solvers
-
Create a vector whose elements depend on the previous element
777 Solvers
-
Generate a random matrix A of (1,-1)
398 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1251 Solvers
-
111 Solvers
More from this Author61
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!