1400 search results - page 3 / 280 » On multiplication in finite fields |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
TC
2002
13 years 7 months ago
2002
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose different implementations of the sparse matrix
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
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...