The Number Theoretic transform brings down the time complexity of polynomial multiplication of large intergers to quasi-linear complexity O(nlogn). An 8-point POLY is processed to NTT domain with t…

ECE 6950: Flexible and Efficient NTT on FPGA for ZKPs

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

Pipeline FFT Implementation in Verilog HDL

This project aims to design an 32-point FFT (Fast Fourier Transform) based DIT (decimation in time) Butterfly Algorithm with multiple clock domains and time-shared design

A 16-point radix-4 FFT chip, including Verilog codes, netlists and layout. Group project.

A configurable C++ generator of pipelined Verilog FFT cores

The 64-point FFT hardware DSP implemented by butterfly structure

R2FFT is a fully synthesizable verilog module for doing the FFT on an FPGA or ASIC.

using verilog to implement an FFT alogrithm in hardware

Verilog code for a circuit implementation of Radix-2 FFT

I present a novel pipelined fast Fourier transform (FFT) architecture which is capable of producing the output sequence in normal order. A single-path delay commutator processing element (SDC PE) h…

An Implementation of the Number Theoretic Transform

Number Theoretic Transform Implementation on GPU for FHE Applications

A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.

several implementations of the number theoretic transform (NTT)

Implementation of Number-theoretic transform(NTT) algorithm on FPGA; 快速数论变换(NTT)的FPGA实现，基为2，有两个并行的蝶形单元

Number theoretic transform - Implementation

Number Theoretic Transform helps speeding up integer polynomial multiplication over finite fields, which is useful in Lattice Based Cryptography and other applications.

Generates Parameters for Number Theoretic Transforms

Python Implementation of the Number Theoretic Transform (NTT).

Parametric NTT/INTT Hardware Generator

NTT를 이용한 Polynomial Mul 검증 및 가속

Python3 implementation of the Discrete Gaussian Transform (DGT) based on A. A. Badawi et al.'s 2019 paper entitled "Efficient Polynomial Multiplication via Modified Discrete Galois Transform and Ne…

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

Throughput-oriented Pipelined NTT Accelerator for FHE applications.