Fast dot product over finite field

Jérémy Jean 1 Stef Graillat 1
1 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00450888
Contributor : Jérémy Jean <>
Submitted on : Wednesday, January 27, 2010 - 3:46:18 PM
Last modification on : Thursday, March 21, 2019 - 1:20:55 PM
Long-term archiving on : Thursday, October 18, 2012 - 1:25:23 PM

File

JJSG2010_DotProduct.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00450888, version 1

Citation

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

Share

Metrics

Record views

237

Files downloads

424