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.
Anglès
Cryptography; Elliptic Curves; Isogeny Volcanoes; Criptografia; Corbes el·líptiques
Australian Computer Society Inc
Reproducció del document publicat a http://ws.acs.org.au/jrpit/JRPITVolumes/JRPIT40/JRPIT40.4.263.pdf
Journal of Research and Practice in Information Technology, 2008, vol. 40, núm. 4, p. 263-273
(c) Australian Computer Society Inc, 2008
Documents de recerca [17848]