The LMS JCM, (2) 118-138. Published 27 Sep 1999. First received 06 Oct 1998.


Constructing isogenies between elliptic curves over finite fields

Steven D. Galbraith



Abstract: Let E1 and E2 be ordinary elliptic curves over a finite field Ep such that #E1(Fp) = #E2(Fp). Tate's isogeny theorem states that there is an isogeny from E1 to E2 which is defined over Fp. The goal of this paper is to describe a probabilistic algorithm for constructing such an isogeny. The algorithm proposed in this paper has exponential complexity in the worst case. Nevertheless, it is efficient in certain situations (that is, when the class number of the endomorphism ring is small). The significance of these results to elliptic curve cryptography is discussed.

This paper is available as PDF (197 KB).

All papers published in the LMS JCM are covered by a copyright agreement with the authors. Access to the papers is bound by this agreement; click here for details.

"Constructing isogenies between elliptic curves over finite fields" has been subsequently referenced by the following articles :

  • Analysis of the GHS Weil descent attack on the ECDLP over characteristic two finite fields of composite degree (15 Nov 2002)
  • Easy decision Diffie–Hellman groups (27 Aug 2004)
  • Go to the Volume 2 index
    Return to the LMS JCM Homepage