Fast Polynomial Multiplication over F260

David Harvey, Joris van der Hoeven, Grégoire Lecerf
2016 Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '16  
Can post-SchönhageStrassen multiplication algorithms be competitive in practice for large input sizes? So far, the GMP library still outperforms all implementations of the recent, asymptotically more ecient algorithms for integer multiplication by Fürer, DeKururSahaSaptharishi, 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 nite fields of characteristic two. Our
more » ... magix implementation is based on the automatic generation of assembly codelets. It outperforms existing implementations in large degree, especially for polynomial matrix multiplication over nite elds.
doi:10.1145/2930889.2930920 dblp:conf/issac/HarveyHL16 fatcat:3uwa3q4i3rgljmwplbfl43plji