Computer Science – Symbolic Computation
Scientific paper
2004-04-05
Computer Science
Symbolic Computation
Scientific paper
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.
No associations
LandOfFree
Efficient dot product over word-size finite fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient dot product over word-size finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient dot product over word-size finite fields will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-666613