20 search results - page 2 / 4 » Computing L-Series of Hyperelliptic Curves |
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
EUROCRYPT
2000
Springer
13 years 9 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...
ISSAC
1995
Springer
13 years 9 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
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 ...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
We present a family of hyperelliptic curves whose Jacobians are suitable for cryptographic use, and whose parameters can be specified in a highly efficient way. This is done via co...