A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm - Inria - Institut national de recherche en sciences et technologies du numérique
Autre Publication Année : 2007

A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm

Résumé

Schönhage-Strassen's algorithm is one of the best known algorithms for multiplying large integers. Implementing it efficiently is of utmost importance, since many other algorithms rely on it as a subroutine. We present here an improved implementation, based on the one distributed within the GMP library. The following ideas and techniques were used or tried: faster arithmetic modulo $2^n+1$, improved cache locality, Mersenne transforms, Chinese Remainder Reconstruction, the $\sqrt{2}$ trick, Harley's and Granlund's tricks, improved tuning. We also discuss some ideas we plan to try in the future.
Fichier principal
Vignette du fichier
fft.pdf (278.86 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00126462 , version 1 (25-01-2007)
inria-00126462 , version 2 (23-05-2007)

Identifiants

  • HAL Id : inria-00126462 , version 1

Citer

Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann. A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm. 2007. ⟨inria-00126462v1⟩
892 Consultations
3909 Téléchargements

Partager

More