205 search results - page 25 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
158
click to vote
VIS
2004
IEEE
16 years 5 months ago
2004
IEEE
Computational simulation of time-varying physical processes is of fundamental importance for many scientific and engineering applications. Most frequently, time-varying simulation...
134
click to vote
JBI
2008
15 years 4 months ago
2008
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
144
click to vote
EUROCRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
143
click to vote
DCC
2002
IEEE
16 years 4 months ago
2002
IEEE
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
157
click to vote
DCC
2000
IEEE
15 years 4 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...