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.

364 Chapter 7 ELLIPTIC CURVE ARITHMETIC<br />

where u is the first number being squared in a given representation; yet there<br />

will be more possible orders for the D = −3 case. To illustrate the detailed<br />

algorithm workings, let us consider the case D = −499 above. Then in the<br />

[Option: curve parameters] step we obtain<br />

T−499 = 4671133182399954782798673154437441310949376<br />

− 6063717825494266394722392560011051008x<br />

+ 3005101108071026200706725969920x 2<br />

+ x 3 .<br />

Note that, as must be, the constant term in this polynomial is a cube. Now<br />

this cubic can be reduced right away (mod p) to yield<br />

S = T−499 mod p = 489476008241378181249146744<br />

+ 356560280230433613294194825x<br />

+ 1662705765583389101921015x 2<br />

+ x 3 ,<br />

but we are illustrating the concept that one could in principle prestore the<br />

Hilbert class polynomials T−D ∈ Z[X], reducing quickly to S ∈ Fp[X]<br />

whenever a new p is being analyzed. We are then to use Algorithm 2.3.10<br />

to find a root j of S = T mod p. A root is found as<br />

j = 431302127816045615339451868.<br />

It is this value that ignites the curve parameter construction. We obtain<br />

c = j/(j − 1728) mod p = 544175025087910210133176287,<br />

and thus end up with two governing cubics (the required nonresidue g can be<br />

taken to be −1 for this p):<br />

y 2 = x 3 + 224384983664339781949157472x ± 469380030533130282816790463,<br />

with respective curve orders<br />

#E =2 89 ± 28743118396413.<br />

Incidentally, which curve has which order is usually an easy computation: For<br />

given a, b parameters, find a point P ∈ E and verify that [#E]P = O, for one<br />

possibility for #E and not the other. In fact, if p>475, Theorem 7.5.2 implies<br />

that either there is a point P on E with [#E ′ ]P = O (where E ′ is the twist<br />

of E) orthereisapointQ on E ′ with [#E]Q = O. Thus, randomly choosing<br />

points, first on one of the curves, then on the other, one should expect to soon<br />

be able to detect which order goes with which curve. In any case, many of the<br />

algorithms based on the Atkin–Morain approach can make use of points that<br />

simply have vanishing multiples, and it is not necessary to ascertain the full<br />

curve order.

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

Saved successfully!

Ooh no, something went wrong!