Introduction to Number Theoretic Transform
By: Banhirup Sengupta, Peenal Gupta, Souvik Sengupta
Potential Business Impact:
Makes secret codes unbreakable by future computers.
The Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption. The Fourier Transform essentially decomposes a signal into its frequencies. They are traditionally sine or cosine waves. NTT works more over groups or finite fields rather than on a continuous signal and polynomials work as the analog of sine waves in case of NTT. Fast Fourier Trnasform (FFT) style NTT or fast NTT has been proven to be useful in lattice-based cryptography due to its ability to reduce the complexity of polynomial multiplication from quadratic to quasilinear. We have introduced the concepts of cyclic, negacyclic convolutions along with NTT and its inverse and their fast versions.
Similar Papers
A Unified Hardware Accelerator for Fast Fourier Transform and Number Theoretic Transform
Cryptography and Security
Makes computers secure from future hacks.
SCE-NTT: A Hardware Accelerator for Number Theoretic Transform Using Superconductor Electronics
Hardware Architecture
Makes secret computer math much faster and safer.
The Equivalence of Fast Algorithms for Convolution, Parallel FIR Filters, Polynomial Modular Multiplication, and Pointwise Multiplication in DFT/NTT Domain
Signal Processing
Makes computer math faster for secret codes.