Efficient dot product over word-size finite fields
Symbolic Computation
2007-05-23 v2
Abstract
We want to achieve efficiency for the exact computation of the dot product of two vectors over word-size finite fields. We therefore compare the practical behaviors of a wide range of implementation techniques using different representations. The techniques used include oating point representations, discrete logarithms, tabulations, Montgomery reduction, delayed modulus.
Cite
@article{arxiv.cs/0404008,
title = {Efficient dot product over word-size finite fields},
author = {Jean-Guillaume Dumas},
journal= {arXiv preprint arXiv:cs/0404008},
year = {2007}
}