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
-
Smallest distance between a point and a rectangle
173 Solvers
-
Project Euler: Problem 10, Sum of Primes
1641 Solvers
-
Find a subset that divides the vector into equal halves
384 Solvers
-
266 Solvers
-
Generalized Laguerre polynomials
59 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!