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
-
Make a run-length companion vector
655 Solvers
-
Flag largest magnitude swings as they occur
688 Solvers
-
1214 Solvers
-
Calculate the probability that at least two people in a group share the same birthday.
102 Solvers
-
How long do each of the stages of the rocket take to burn?
439 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!