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
-
Find the sum of all the numbers of the input vector
53417 Solvers
-
1430 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2521 Solvers
-
270 Solvers
-
Without the French accent please!
227 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!