Isogeny cordillera algorithm to obtain cryptographically good elliptic curves

Miret, J., Sadornil, D., Tena, J., Tomas, R. and Valls, M.

    The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computationally unfeasible when elliptic curves are suitably chosen. This paper provides an algorithm to obtain cryptographically good elliptic curves from a given one. The core of such a procedure lies on the usage of successive chains of isogenies, visiting different volcanoes of isogenies which are located in different l-cordilleras.
Cite as: Miret, J., Sadornil, D., Tena, J., Tomas, R. and Valls, M. (2007). Isogeny cordillera algorithm to obtain cryptographically good elliptic curves. In Proc. Fifth Australasian Information Security Workshop (Privacy Enhancing Technologies) (AISW 2007), Ballarat, Australia. CRPIT, 68. Brankovic, L. and Steketee, C., Eds. ACS. 153-157.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS