8 search results - page 1 / 2 » An Extension of Kedlaya's Algorithm to Hyperelliptic Curves ... |
JOC
2006
13 years 4 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 ...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
We present an algorithm for counting points on superelliptic curves yr = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorit...
WAIFI
2007
Springer
13 years 10 months ago
2007
Springer
We propose a simple and efficient deterministic extractor for the (hyper)elliptic curve C, defined over Fq2 , where q is some power of an odd prime. Our extractor, for a given poi...
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...