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.
Solve

Solution Stats

11 Solutions

4 Solvers

Last Solution submitted on May 25, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers4

Tim Chris Cleveland George Berken David Hill

Suggested Problems

More from this Author63

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!