This paper will examine the role of elliptic curves in the field of cryptography. The applicability of an analogous discrete logarithm problem to elliptic curve groups provides a basis for the security of elliptic curves. Two cryptographic protocols which implement elliptic curves are examined as well as two popular methods to solve the elliptic curve discrete logarithm problem. Finally, a comp...

In this paper, we present a classification of elliptic curves defined over a cubic extension of a finite field with odd characteristic which have coverings over the finite field therefore subjected to the GHS attack. The densities of these weak curves, with hyperelliptic and non-hyperelliptic coverings, are then analyzed respectively. In particular, we show, for elliptic curves defined by Legen...

The study of elliptic curves has historically been a subject of almost purely mathematical interest. However, Koblitz and Miller independently showed that elliptic curves can be used to implement cryptographic primitives [13], [17]. This thrust elliptic curves from the abstract realm of pure mathematics to the preeminently applied world of communications security. Public key cryptography in gen...

‎It is shown that the knowledge of a surjective morphism $Xto Y$ of complex‎ ‎curves can be effectively used‎ ‎to make explicit calculations‎. ‎The method is demonstrated‎ ‎by the calculation of $j(ntau)$ (for some small $n$) in terms of $j(tau)$ for the elliptic curve ‎with period lattice $(1,tau)$‎, ‎the period matrix for the Jacobian of a family of genus-$2$ curves‎ ‎complementing the classi...

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

Elliptic divisibility sequences are integer recurrence sequences, each of which is associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base fields. Suppose E is an elliptic curve over a field K, and P1, . . . , Pn are points on E defined over K. To this information we associate an ...

We study the structure of the Mordell–Weil group of elliptic curves over number fields of degree 2, 3, and 4. We show that if T is a group, then either the class of all elliptic curves over quadratic fields with torsion subgroup T is empty, or it contains curves of rank 0 as well as curves of positive rank. We prove a similar but slightly weaker result for cubic and quartic fields. On the other...

This is a introduction to some aspects of the arithmetic of elliptic curves, intended for readers with little or no background in number theory and algebraic geometry. In keeping with the rest of this volume, the presentation has an algorithmic slant. We also touch lightly on curves of higher genus. Readers desiring a more systematic development should consult one of the references for further ...

We review the history of elliptic curves and show that it is possible to form a group law using the points on an elliptic curve over some field L. We review various methods for computing the order of this group when L is finite, including the complex multiplication method. We then define and examine the properties of elliptic pairs, lists, and cycles, which are related to the notions of amicabl...

1. Throughout P = C ∪ {∞} denotes the Riemann sphere, H denotes the upper half plane, C∗ denotes the multiplicative group of complex numbers, and P = (C \ {0})/C∗ denotes n dimensional complex projective space. For w ∈ C \{0} let [w] := wC∗ denote the corresponding point of P. For A ∈ GLn+1(C) let MA denote the corresponding automorphism of projective space so that MA([w]) = [Aw]. Identify P an...