Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Schönhage and Strassen designed an algorithm that improved the multiplication time for two integers of at most n bits to O(log n log log n). In 2007, Martin Fürer presented a new algorithm that runs in O n log n ⋅ 2 O(log * n) , where log * n is the iterated logarithm of n.We explain how we can put Fürer's ideas into practice for multiplying polynomials over a prime field Z pZ, for which p is a Generalized Fermat prime of the form p = r k + 1 where k is a power of 2 and r is of machine word size. When k is at least 8, we show that multiplication inside such a prime field can be efficiently implemented via Fast Fourier Transform (FFT). Taking advantage of Cooley-Tukey tensor formula and the fact that r is a 2k-th primitive root of unity in Z pZ, we obtain an efficient implementation of FFT over Z pZ. This implementation outperforms comparable implementations either using other encodings of Z pZ or other ways to perform multiplication in Z pZ.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.