Efficient dot product over word-size finite fields
| dc.creator | Dumas, Jean-Guillaume | |
| dc.date | 2004-04-05 | |
| dc.date | 2004-04-19 | |
| dc.date.accessioned | 2026-07-07T03:21:05Z | |
| dc.date.available | 2026-07-07T03:21:05Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0404008 | |
| dc.identifier | http://arxiv.org/abs/cs/0404008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32064 | |
| dc.subject | Symbolic Computation | |
| dc.subject | F.2.4; B.2.4 | |
| dc.title | Efficient dot product over word-size finite fields | |
| dc.type | text |