Fast Polynomial Multiplication over F_(2^60) - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2016

Fast Polynomial Multiplication over F_(2^60)


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.
Fichier principal
Vignette du fichier
f2kmul-preprint.pdf (290.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01265278 , version 1 (31-01-2016)


  • HAL Id : hal-01265278 , version 1


David Harvey, Joris van der Hoeven, Grégoire Lecerf. Fast Polynomial Multiplication over F_(2^60). 2016. ⟨hal-01265278⟩
430 View
819 Download


Gmail Facebook X LinkedIn More