Number Theoretic Transform (NTT) - MATLAB Cody - MATLAB Central

Problem 46696. Number Theoretic Transform (NTT)

Difficulty:
(2)
Rate
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

40.0% Correct | 60.0% Incorrect
Last Solution submitted on Jan 23, 2023

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

Group

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

Problem Recent Solvers2

Problem Tags

ntt number theoretic t...

Community Treasure Hunt

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

Start Hunting!
Go to top of page