Faster Multiplication in GF(2)[x] - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Reports (Research Report) Year : 2007

Faster Multiplication in GF(2)[x]

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.

Domains

Data Structures and Algorithms [cs.DS]
Fichier principal
Vignette du fichier
RR-6359.pdf (276.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Paul Zimmermann  : Connect in order to contact the contributor

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

Submitted on : Monday, November 19, 2007-11:04:07 AM

Last modification on : Friday, March 24, 2023-2:52:49 PM

Long-term archiving on: Thursday, September 23, 2010-4:05:05 PM

Download

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

  • HAL Id : inria-00188261 , version 3

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INRIA-RRRT
1128 View
2399 Download

Share

Gmail Facebook X LinkedIn More