13 search results - page 1 / 3 » Weil Descent of Elliptic Curves over Finite Fields of Charac... |
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
INDOCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
IEICET
2006
13 years 4 months ago
2006
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
EUROCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...