Efficient dot product over word-size finite fields
<|reference_start|>Efficient dot product over word-size finite fields: 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.<|reference_end|>
@article{dumas2004efficient,
    title={Efficient dot product over word-size finite fields},
    author={Jean-Guillaume Dumas},
    journal={arXiv preprint arXiv:cs/0404008},
    year={2004},
    number={IMAG - LMC RR n 1064 - I},
    archivePrefix={arXiv},
    eprint={cs/0404008},
    primaryClass={cs.SC}
}