Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Fast Polynomial Multiplication over F_(2^60)

Abstract : 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.
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download
Contributor : Grégoire Lecerf <>
Submitted on : Sunday, January 31, 2016 - 6:18:39 PM
Last modification on : Thursday, March 5, 2020 - 6:30:29 PM
Document(s) archivé(s) le : Friday, November 11, 2016 - 10:51:42 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads