47 search results - page 4 / 10 » Solving a 676-Bit Discrete Logarithm Problem in GF(36n) |
EUROCRYPT
2000
Springer
15 years 1 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...
ISPEC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
CRYPTO
2000
Springer
15 years 1 months ago
2000
Springer
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
ASIACRYPT
2003
Springer
15 years 2 months ago
2003
Springer
We present a variation of the index calculus attack by Gaudry which can be used to solve the discrete logarithm problem in the Jacobian of hyperelliptic curves. The new algorithm h...
MOC
2002
14 years 9 months ago
2002
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...