Fast dot product over finite field - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2010

Fast dot product over finite field


Finite fields are widely used in numerous areas like cryptography, error-correcting codes or computer algebra. Dot products are ubiquitous in all computations especially when dealing with linear algebra. Developing fast libraries for computing dot products in finite fields is a key tool to tackle various problems in scientific computing. In this paper, our aim is to present several possibilities to use fast floating-point units for computing dot products in finite fields. The main concern is then to properly manage rounding errors that may appear during the computation. To solve this problem, we use error-free transformations (EFT). Using these EFT on recent processors (with an FMA), we show that it is possible to deal with large finite fields. We also compare our approach with Residue Number Systems (RNS), which is a modular approach. The RNS approach is presented using either integer arithmetic or floating-point arithmetic. Numerical experiments make it possible to compare the performances of these different approaches.
Fichier principal
Vignette du fichier
JJSG2010_DotProduct.pdf (170.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00450888 , version 1 (27-01-2010)


  • HAL Id : hal-00450888 , version 1


Jérémy Jean, Stef Graillat. Fast dot product over finite field. 2010. ⟨hal-00450888⟩
129 View
722 Download


Gmail Mastodon Facebook X LinkedIn More