Faster Multiplication in GF(2)[x] (original) (raw)

Résumé

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.

Domaines

Connectez-vous pour contacter le contributeur

https://inria.hal.science/inria-00188261

Soumis le : lundi 19 novembre 2007-10:41:50

Dernière modification le : mercredi 18 mars 2026-11:52:02

Archivage à long terme le : mardi 21 septembre 2010-15:19:27

Dates et versions

inria-00188261 , version 1 (16-11-2007)

inria-00188261 , version 2 (19-11-2007)

inria-00188261 , version 3 (19-11-2007)

inria-00188261 , version 4 (07-11-2008)

Licence

Identifiants

Citer

Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. Faster Multiplication in GF(2)[x]. [Research Report] RR-6359, 2007. ⟨inria-00188261v2⟩

1819 Consultations

4256 Téléchargements