Edwards curves and CM curves
نویسنده
چکیده
Edwards curves are a particular form of elliptic curves that admit a fast, unified and complete addition law. Relations between Edwards curves and Montgomery curves have already been described. Our work takes the view of parameterizing elliptic curves given by their j-invariant, a problematic that arises from using curves with complex multiplication, for instance. We add to the catalogue the links with Kubert parameterizations of X0(2) and X0(4). We classify CM curves that admit an Edwards or Montgomery form over a finite field, and justify the use of isogenous curves when needed.
منابع مشابه
Twisted Edwards Curves
This paper introduces “twisted Edwards curves,” a generalization of the recently introduced Edwards curves; shows that twisted Edwards curves include more curves over finite fields, and in particular every elliptic curve in Montgomery form; shows how to cover even more curves via isogenies; presents fast explicit formulas for twisted Edwards curves in projective and inverted coordinates; and sh...
متن کاملIsomorphism classes of Edwards curves over finite fields
Edwards curves are an alternate model for elliptic curves, which have attracted notice in cryptography. We give exact formulas for the number of Fq-isomorphism classes of Edwards curves and twisted Edwards curves. This answers a question recently asked by R. Farashahi and I. Shparlinski.
متن کاملIsogenies on Edwards and Huff curves
Isogenies of elliptic curves over finite fields have been well-studied, in part because there are several cryptographic applications. Using Vélu’s formula, isogenies can be constructed explicitly given their kernel. Vélu’s formula applies to elliptic curves given by a Weierstrass equation. In this paper we show how to similarly construct isogenies on Edwards curves and Huff curves. Edwards and ...
متن کاملFast Algorithm for Converting Ordinary Elliptic Curves into Binary Edward Form
Scalar multiplication is computationally the most expensive operation in elliptic curve cryptosystems. Many techniques in literature have been proposed for speeding up scalar multiplication. In 2008, Bernstein et al proposed binary Edwards curves on which scalar multiplication is faster than traditional curves. At Crypto 2009, Bernstein obtained the fastest implementation for scalar multiplicat...
متن کاملFaster point scalar multiplication on NIST elliptic curves over GF(p) using (twisted) Edwards curves over GF(p³)
In this paper we present a new method for fast scalar multiplication on el-liptic curves over GF (p) in FPGA using Edwards and twisted Edwards curves over GF (p 3). The presented solution works for curves with prime group order (for example for all NIST curves over GF (p)). It is possible because of using 2-isogenous twisted Edwards curves over GF (p 3) instead of using short Weierstrass curves...
متن کامل