Sciweavers

3 search results - page 1 / 1
» Analysis of the GHS Weil Descent Attack on the ECDLP over Ch...
Sort
View
INDOCRYPT
2001
Springer
13 years 9 months ago
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
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...
Markus Maurer, Alfred Menezes, Edlyn Teske
EUROCRYPT
2001
Springer
13 years 9 months ago
How Secure Are Elliptic Curves over Composite Extension Fields?
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 ...
Nigel P. Smart
ASIACRYPT
2000
Springer
13 years 9 months ago
Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three
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...
Seigo Arita