Fast Fourier Transform Algorithm / Number Theoretic Transform
Computations with the Mertens function. To accompany a preprint manuscript (http://arxiv.org/abs/2102.05842).
Number theoretic transform
Implementation of the Number Theoretic Transform (NTT) and Fast Fourier Transform (FFT) algorithms
🦋 Integer Fast Fourier Transform algorithms for JavaScript
Employed into Crystal-Kyber Algorithm, a prominent Lattice-based Post Quantum Cryptography(PQC) algorithm, for polynomial multiplication of higher degrees.
ImplementaciĂłn de la transformada numĂ©rico-teĂłrica. Asignatura de ProgramaciĂłn de Arquitecturas MultinĂşcleo. Grado en IngenierĂa Informática. Facultad de Informática. Universidad de Murcia.
Efficient Algorithm Level Error Detection for Number-Theoretic Transform
a method for efficient large integer arithmetic in cryptography
Verilog Implementation of the Number Theoretic Transform (NTT) and its inverse operation (INTT) utilizing modulo arithmetic for lattice-based PQC on FPGAs
Welcome to the GPU-FFT-Optimization repository! We present cutting-edge algorithms and implementations for optimizing the Fast Fourier Transform (FFT) on Graphics Processing Units (GPUs).
Finite Field Operations on GPGPU
Welcome to the GPU-NTT-Optimization repository! We present cutting-edge algorithms and implementations for optimizing the Number Theoretic Transform (NTT) on Graphics Processing Units (GPUs).
High-speed full CRYSTALS-DILITHIUM implementation on FPGA: Keygen, Sign, Verify.
Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
Add a description, image, and links to the number-theoretic-transform topic page so that developers can more easily learn about it.
To associate your repository with the number-theoretic-transform topic, visit your repo's landing page and select "manage topics."