Faster Multiplication in GF(2)[x] - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Faster Multiplication in GF(2)[x]

(1) , (2) , (2) , (2)
1
2

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.
Fichier principal
Vignette du fichier
gf2x.pdf (513.37 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and 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)

Identifiers

Cite

Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. Faster Multiplication in GF(2)[x]. Algorithmic Number Theory – ANTS-VIII, May 2008, Banff, Canada. pp.153-166, ⟨10.1007/978-3-540-79456-1⟩. ⟨inria-00188261v4⟩
979 View
1896 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More