Isogeny cordillera algorithm to obtain cryptographically good elliptic curves

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 –cordilleras.

• Type: Conference
• Year: 2007
• Where: ACSW
• Authors: Josep M. Miret, D. Sadornil, J. Tena, R. Tomas, Magda Valls
• Keywords: ACSW 2007, Elliptic Curve Cryptosystems, Elliptic Curve Discrete Logarithm Problem, Elliptic Curves, Security Privacy