Fast Polynomial Multiplication over


Can post-Schönhage–Strassen multiplication algorithms be competitive in practice for large input sizes? So far, the GMP library still outperforms all implementations of the recent, asymptotically more efficient algorithms for integer multiplication by Fürer, De–Kurur–Saha–Saptharishi, and ourselves. In this paper, we show how central ideas of our recent asymptotically fast algorithms turn out to be of practical interest for multiplication of polynomials over finite fields of characteristic two. Our Mathemagix implementation is based on the automatic generation of assembly codelets. It outperforms existing implementations in large degree, especially for polynomial matrix multiplication over finite fields.

Authors: David Harvey, Joris van der Hoeven, Grégoire Lecerf

Keywords: Polynomial multiplication, finite field, implementation, high performance, FFT

A.M.S. subject classification: 68W30, 68Q17, 68W40

A.C.M. computing class: F.2.1 Computation in finite fields, G.4 Mathematical software

View: Html, TeXmacs, Pdf, BibTeX