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. For such an elliptic curve E, we construct a Cab curve D on its Weil restriction in order to reduce the discrete logarithm problem on E to that on D. And we show that the genus of D is small enough so that D is attacked by a modified form of Gaudry’s variant for a suitable E. We also see such a weak elliptic curve is easily constructed.
CITATION STYLE
Arita, S. (2000). Weil descent of elliptic curves over finite fields of characteristic three. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1976, pp. 248–258). Springer Verlag. https://doi.org/10.1007/3-540-44448-3_19
Mendeley helps you to discover research relevant for your work.