Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.

High-speed full CRYSTALS-DILITHIUM implementation on FPGA: Keygen, Sign, Verify.

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

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

Employed into Crystal-Kyber Algorithm, a prominent Lattice-based Post Quantum Cryptography(PQC) algorithm, for polynomial multiplication of higher degrees.

Verilog Implementation of the Number Theoretic Transform (NTT) and its inverse operation (INTT) utilizing modulo arithmetic for lattice-based PQC on FPGAs

Finite Field Operations on GPGPU

a method for efficient large integer arithmetic in cryptography

Number theoretic transform

Efficient Algorithm Level Error Detection for Number-Theoretic Transform

🦋 Integer Fast Fourier Transform algorithms for JavaScript

high-performance CPU implementations of cryptographic kernels

Computations with the Mertens function. To accompany a preprint manuscript (http://arxiv.org/abs/2102.05842).

Implementation of the Number Theoretic Transform (NTT) and Fast Fourier Transform (FFT) algorithms

Fast Fourier Transform Algorithm / Number Theoretic Transform

GPU-accelerated Number-Theoretic Transform for ZK-Proof generation. Targets the NTT bottleneck (91% of Groth16 prover time) via two CUDA optimizations: async double-buffered pipeline eliminating CPU-GPU transfer overhead, and IADD3-path Montgomery multiplication reducing finite-field instruction latency. BLS12-381, Ampere sm_86, Nsight-profiled.

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.