Note 4/20/17: Due to circumstances I have had to move my web pages here.
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:
Given a field GF(2m) and a irreducable polynomial, the curve is
of the form: y2 + xy = x3 + ax2 + b.
Select a point corresponding to a message you want to send.
This particular approach is using elliptic curves to simulate
Note that there is no obvious way of mapping messages to points
(Not all values for x or y correspond to valid points).
This, along with the fact that symmetric key methods such as
DES or AES are generally
faster, means that ellipitic curve cryptography is rarely used for actually encrypting
Also, ElGamal used in this way is considered susceptible
to some attacks, so should be avoided.
Sender selected value r:
The details are at the bottom of the page
Return to my home page