13 search results - page 1 / 3 » On the Bounded Sum-of-Digits Discrete Logarithm Problem in F... |
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we study the bounded sum-of-digits discrete logarithm problem in finite fields. Our results concern primarily with
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...
PKC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
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...
ALGORITHMICA
2006
13 years 4 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...