#

polynomial-multiplication

Here are 3 public repositories matching this topic...

Optimized-Brain / AKS-Algorithm-Optimized-with-Fast-Fourier-Transform

Optimized AKS Primality Test with Fast Fourier Transform (FFT) for enhanced performance in large number primality checking. This implementation improves the efficiency of the AKS algorithm using FFT for polynomial multiplication, offering significant speedup.

fast-fourier-transform aks-algorithm primality-testing algorithm-complexity polynomial-multiplication

Updated Apr 28, 2025
Python

KasraAhmadi / NTT_Error_Detection

Efficient Algorithm Level Error Detection for Number-Theoretic Transform

cryptography fpga hls cpp simulation number-theoretic-transform polynomial-multiplication ntt error-detection kyber pqc vitis

Updated Sep 19, 2024
Python

yusufarsln98 / comparision-of-polynomial-multiplications

fast-fourier-transform symbolic-computation polynomial-multiplication

Updated Jan 14, 2025
Python

Improve this page

Add a description, image, and links to the polynomial-multiplication topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the polynomial-multiplication topic, visit your repo's landing page and select "manage topics."