Fast Polynomial Multiplication
The development of computers since 1940 has led to new advancements in very old mathematics. In Section 7B we looked at Karatsuba multiplication, a faster way of multiplying numbers. In Section 9F we described a more efficient way to raise a number to a power modulo m. and in Section 9G we presented Montgomery multiplication, a way of avoiding long division modulo m.
In this chapter we look at multiplication of polynomials.
KeywordsFast Fourier Transform Discrete Fourier Transform Chinese Remainder Theorem Fast Fourier Transform Method Ordinary Multiplication
Unable to display preview. Download preview PDF.