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

Problem 46761. Inverse Number Theoretic Transform (iNTT)

Difficulty:
(2)
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
PIVlab surpasses 100K all-time File Exchange downloads
During the past twelve months, PIVlab, a MATLAB Community Toolbox for particle...
Mike Croucher in General
4
8
View Post
LLMs with MATLAB updated to support the latest OpenAI Models
Large Languge model with MATLAB, a free add-on that lets you access...
Toshiaki Takeuchi in Generative AI
2
4
View Post

Group

Advanced Cryptography Algorithms and Mathematics Image
Advanced Cryptography Algorithms and Mathematics
  • 21 Problems
  • 0 Finishers

Problem Recent Solvers1

Problem Tags

inverse number the...

Community Treasure Hunt

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

Start Hunting!