inria-00188261, version 4
Faster Multiplication in GF(2)[x]
Richard P. Brent a, 1Pierrick Gaudry
2Emmanuel Thomé
2Paul Zimmermann
2
ANTS-VIII 5011 (2008) 153-166
Abstract: In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook's, Schoenhage's and Cantor's algorithms. For most of them, we propose improvements that lead to practical speedups.
- a – Australian National University
- 1: Mathematical Sciences Institute (MSI)
- Australian National University
- 2: CACAO (Courbes, Algèbre, Calculs, Arithmétique des Ordinateurs) (INRIA Lorraine - LORIA)
- CNRS : UMR7503 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine
- Domain : Computer Science/Data Structures and Algorithms
- Available versions : v1 (2007-11-16) v2 (2007-11-19) v3 (2007-11-19) v4 (2008-11-07)
- inria-00188261, version 4
- http://hal.inria.fr/inria-00188261
- oai:hal.inria.fr:inria-00188261
- From: Pierrick Gaudry
- Submitted on: Friday, 7 November 2008 08:33:25
- Updated on: Thursday, 13 November 2008 21:49:38






Associated documents
Export