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
-
Sort a list of complex numbers based on far they are from the origin.
5603 Solvers
-
Back to basics 23 - Triangular matrix
974 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
531 Solvers
-
334 Solvers
-
8201 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!