97 search results - page 7 / 20 » Polynomial Multiplication over Finite Fields Using Field Ext... |
CORR
2004
Springer
13 years 6 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...
ISSAC
2004
Springer
14 years 2 days ago
2004
Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
ASAP
2004
IEEE
13 years 10 months ago
2004
IEEE
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
ASIACRYPT
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...