HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Faster Multiplication in GF(2)[x]

Richard Brent 1 Pierrick Gaudry 2 Emmanuel Thomé 2 Paul Zimmermann 2
2 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/inria-00188261
Contributor : Pierrick Gaudry Connect in order to contact the contributor
Submitted on : Friday, November 7, 2008 - 8:33:25 AM
Last modification on : Friday, February 4, 2022 - 3:34:24 AM
Long-term archiving on: : Friday, September 24, 2010 - 11:15:27 AM

File

gf2x.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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

Share

Metrics

Record views

952

Files downloads

1715