GitHub

Multiplying-two-polynomials-using-FFT

For Naive Approach we'll just multiply each term of first polynomial with each term of second polynomial. This will take O(N^2) Time. For FFT approach Using Fast Fourier Transform will Give Us Time ...
IEEE

Fast multiplication techniques for public key cryptography

Abstract: We describe two novel techniques for multiplying polynomials which help with accelerating popular public key cryptographic algorithms like RSA and key exchange techniques like Elliptic Curve ...