Mathematics of Computation · 2015 · 71 citations · 12 references
Isogenies are the morphisms between elliptic curves and are, accordingly, a topic of interest in the subject. As such, they have been well studied, and have been used in several cryptographic applications. Véluâs formulas show how to explicitly evaluate an isogeny, given a specification of the kernel as a list of points. However, Véluâs formulas only work for elliptic curves specified by a Weierstrass equation. This paper presents formulas similar to Véluâs that can be used to evaluate isogenies on Edwards curves and Huff curves, which are normal forms of elliptic curves that provide an alternative to the traditional Weierstrass form. Our formulas are not simply compositions of Véluâs formulas with mappings to and from Weierstrass form. Our alternate derivation yields efficient formulas for isogenies with lower algebraic complexity than such compositions. In fact, these formulas have lower algebraic complexity than Véluâs formulas on Weierstrass curves.
12
Elliptic curves: number theory and cryptography
Choice Reviews Online · 2004 · 560 citations
Public Key Algorithm, Cryptographic Primitive, Engineering +10
Daniel J. Bernstein, Peter Birkner, Marc Jóye et al. · TU/e Research Portal (Eindhoven University of Technology) · 2008 · 152 citations · Full text