205 search results - page 20 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
JOC
2006
13 years 7 months ago
2006
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...
MOC
2000
13 years 7 months ago
2000
The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing ...
ICCS
2004
Springer
14 years 23 days ago
2004
Springer
Air pollution models usually start from the computation of the velocity field of a fluid. In this paper, we present a model for computing that field based on the contribution of...
PRESENCE
2006
13 years 7 months ago
2006
The generation of multimodal virtual environments for surgical training is complicated by the necessity to develop heterogeneous simulation scenarios such as surgical incision, ca...
INDOCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...