Inverse Number Theoretic Transform (iNTT) - MATLAB Cody - MATLAB Central

Problem 46761. Inverse Number Theoretic Transform (iNTT)

Difficulty:
(52)
Rate
Given an input polynomial (rhat) of length n that has been Number Theoretic Transformed (NTT) modulo p, a prime number using it's primitive nth root of unity as the generator for the inverse tweedle factors, convert the polynominal coefficents by Inverse Number Theoretic Transform (iNTT) mod p back into the original polynomial coefficents.
Solve

Solution Stats

100.0% Correct | 0.0% Incorrect
Last Solution submitted on Oct 13, 2020

Problem Comments

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers1

Suggested Problems

More from this Author57

Problem Tags

inverse number the...

Community Treasure Hunt

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

Start Hunting!
Go to top of page