Faster multiplication in GF(2)[x]

Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    40 Citations (Scopus)

    Abstract

    In this paper, we discuss an implementation of various algorithms for multiplying polynomials in : variants of the window methods, Karatsuba's, Toom-Cook's, Schönhage's and Cantor's algorithms. For most of them, we propose improvements that lead to practical speedups.

    Original languageEnglish
    Title of host publicationAlgorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings
    Pages153-166
    Number of pages14
    DOIs
    Publication statusPublished - 2008
    Event8th International Symposium on Algorithmic Number Theory, ANTS-VIII - Banff, Canada
    Duration: 17 May 200822 May 2008

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume5011 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference8th International Symposium on Algorithmic Number Theory, ANTS-VIII
    Country/TerritoryCanada
    CityBanff
    Period17/05/0822/05/08

    Cite this