Note 4/20/17: Due to circumstances I have had to move my web pages here.

Choose one of the two following elliptic curves:
Curve over GF(p)

Given a prime p, the elliptic curves modulo p that we use are of the form: y2 = x3 + ax + b.

The curve and key information used for this page is:

Curve over GF(2m)

Given a field GF(2m) and a irreducable polynomial, the curve is of the form: y2 + xy = x3 + ax2 + b.

The curve and key information used for this page is:

A common use of elliptic curve cryptography is to generate a shared secret key for use in secret key systems. The Diffie-Hellman protocol can be applied to elliptic curves as follows: A's random value:
B's random value:


Details:


Return to my home page

Send Mail