Isogeny cordillera algorithm to obtain cryptographically good elliptic curves
Josep M. Miret, Daniel Sadornil, Juan Guillermo Lohmann Luca de Tena, R. Tomàs, Magda Valls · 2007
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.