Elliptic Curves -- Galois Field Arithmetic

Find out about the wonderful world of GF[2^K], where 2=0, plus is minus, and squaring is a linear operator. And why they are called elliptic curves.

Tech report about fast GF arithmetic (postscript, 96KB) (compressed, 54KB) http://www.cs.arizona.edu/~rcs/ecrv/TR95-03.ps or ftp://ftp.cs.arizona.edu/reports/1995/TR95-03.ps.Z

Documentation for the elliptic curve program (28KB) (gzip 11KB) http://www.cs.arizona.edu/~rcs/ecrv/ell2-doc
Includes a very brief introduction to arithmetic for the Galois Fields GF[2^K] and elliptic curves over these fields.

Examples of running the elliptic curve program (19KB) (gzip 4KB) http://www.cs.arizona.edu/~rcs/ecrv/ell2.examples

My workhorse elliptic curve program (346KB) (gzip 61KB) http://www.cs.arizona.edu/~rcs/ecrv/ell2xx.c
The C source code for most of my work with GF[2^K] and elliptic curves over these fields. Lots of field arithmetic and curve arithemtic. Pick out the pieces you need.

Assembly code for GF multiplication on the Alpha (7KB) http://www.cs.arizona.edu/~rcs/ecrv/mult155b64c.s
Needed for the DEC Alpha processor.