Page:Fips186-2-change1.pdf/31

 Any point of order r can serve as the base point. Each curve is supplied with a sample base point G = (G$x$, G$y$). Users may want to generate their own base points to ensure cryptographic separation of networks.

2. Curves over Prime Fields

For each prime p, a pseudo-random curve

$$

of prime order r is listed. (Thus, for these curves, the cofactor is always f = 1.)

The following parameters are given:


 * The prime modulus p
 * The order r
 * the 160-bit input seed s to SHA-1 based algorithm
 * The output c of the SHA-1 based algorithm
 * The coefficient b (satisfying b$2$ c ≡ -27 (mod p))
 * The base point x coordinate G$x$
 * The base point y coordinate G$y$

The integers p and r are given in decimal form; bit strings and field elements are given in hex. _______________________