Attached is my first attempt at some procedures for implementing elliptic
curves mod p, where p is a prime > 3. Not all procedures are optimized, and
I have not implemented the Schoof-Elkies-Atkins algorithm for finding the
order of the curve. Also, I have not yet implemented curves over general
finite fields GF(p^n).
These procedures can perform arithmetic (addition, point multiplication) on
curves of arbitrary size, but the procedures for finding the curve order,
the order of a point, and logarithms, are only viable on smallish curves
(say, p<2^30).
cheers,
Alasdair
-------------- next part --------------
A non-text attachment was scrubbed...
Name: elliptic.mac
Type: application/octet-stream
Size: 9106 bytes
Desc: not available
Url : http://www.math.utexas.edu/pipermail/maxima/attachments/20080502/ab0e5b19/attachment.obj
-------------- next part --------------
A non-text attachment was scrubbed...
Name: elliptic.dem
Type: application/octet-stream
Size: 1568 bytes
Desc: not available
Url : http://www.math.utexas.edu/pipermail/maxima/attachments/20080502/ab0e5b19/attachment-0001.obj