19 search results - page 2 / 4 » Group Law Computations on Jacobians of Hyperelliptic Curves |
EUROCRYPT
2000
Springer
13 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...
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...
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...
MOC
2002
13 years 4 months ago
2002
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic...