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
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1971 Solvers
-
140 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2026 Solvers
-
101 Solvers
-
poll: would you like the regexp (?@cmd) functionality to be banned in Cody?
181 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!