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

This repository collects several tricks for polynomial multiplications that have found practical importance in lattice-based cryptosystems. In the literature, researchers argued the efficiency of ...

Abstract: In this paper, we present a new method for multiplying polynomials in Chebyshev form. Our approach has two steps. First, the well-known Karatsuba's algorithm is applied to polynomials ...