53 search results - page 3 / 11 » Lifting Elliptic Curves and Solving the Elliptic Curve Discr... |
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
GMP
2003
IEEE
13 years 10 months ago
2003
IEEE
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
TIT
2010
13 years 5 days ago
2010
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
PKC
2010
Springer
13 years 7 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...