12 search results - page 2 / 3 » FFPACK: finite field linear algebra package |
CORR
2004
Springer
14 years 10 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...
101
Voted
COCO
2008
Springer
15 years 12 hour ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
76
Voted
TIT
2011
14 years 5 months ago
2011
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
CORR
2008
Springer
14 years 10 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...
122
Voted
CSR
2008
Springer
15 years 7 hour ago
2008
Springer
We offer cryptanalysis of a key exchange scheme due to Stickel [11], which was inspired by the well-known Diffie-Hellman protocol. We show that Stickel's choice of platform (t...