10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

358 Chapter 7 ELLIPTIC CURVE ARITHMETIC<br />

But with modified title, that title now ending with “... square roots mod p,”<br />

the modified paper [Schoof 1985] was, as we appreciate, finally published.<br />

Though the SEA method remains as of this writing the bastion of hope<br />

for point counting over E(Fp) withp prime, there have been several very<br />

new—and remarkable—developments for curves E(F p d) where the prime p is<br />

small. In fact, R. Harley showed in 2002 that the points can be counted, for<br />

fixed characteristic p, intime<br />

O(d 2 ln 2 d ln ln d),<br />

and succeeded in counting the points on a curve over the enormous field<br />

F 2 130020. Other lines of development are due to T. Satoh on canonical lifts<br />

and even p-adic forms of the arithmetic-geometric mean (AGM). One good<br />

way to envision the excitement in this new algebraic endeavor is to peruse the<br />

references at Harley’s site [Harley 2002].<br />

7.5.3 Atkin–Morain method<br />

We have addressed the question, given a curve E = Ea,b(Fp), what is #E? A<br />

kind of converse question—which is of great importance in primality proving<br />

and cryptography is, can we find a suitable order #E, andthen specify a<br />

curve having that order? For example, one might want a prime order, or an<br />

order 2q for prime q, or an order divisible by a high power of 2. One might<br />

call this the study of “closed-form” curve orders, in the following sense: for<br />

certain representations 4p = u 2 + |D|v 2 , as we have encountered previously in<br />

Algorithm 2.3.13, one can write down immediately certain curve orders and<br />

also—usually with more effort—the a, b parameters of the governing cubic.<br />

These ideas emerged from the seminal work of A. O. L. Atkin in the latter<br />

1980s and his later joint work with F. Morain.<br />

In order to make sense of these ideas it is necessary to delve a bit into some<br />

additional theoretical considerations on elliptic curves. For a more thorough<br />

treatment, see [Atkin and Morain 1993b], [Cohen 2000], [Silverman 1986].<br />

For an elliptic curve E defined over the complex numbers C, onemay<br />

consider the “endomorphisms” of E. These are group homomorphisms from<br />

the group E to itself that are given by rational functions. The set of such<br />

endomorphisms, denoted by End(E), naturally form a ring, where addition<br />

is derived from elliptic addition, and multiplication is composition. That is,<br />

if φ, σ are in End(E), then φ + σ is the endomorphism on E that sends a<br />

point P to φ(P )+σ(P ), the latter “+” being elliptic addition; and φ · σ is<br />

the endomorphism on E that sends P to φ(σ(P )).<br />

If n is an integer, the map [n] that sends a point P on E to [n]P is a member<br />

of End(E), since it is a group homomorphism and since Theorem 7.5.5 shows<br />

that [n]P has coordinates that are rational functions of the coordinates of<br />

P . Thus the ring End(E) contains an isomorphic copy of the ring of integers<br />

Z. It is often the case, in fact usually the case, that this is the whole story<br />

for End(E). However, sometimes there are endomorphisms of E that do not<br />

correspond to an integer. It turns out, though, that the ring End(E) is never

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!