It does not appear to be faster than the current Montgomery code
except for very small moduli (somewhere between 192 and 224 bits
in a 64-bit Sun environment, and even less than 192 bits
on 32 bit systems).

which indicate its purpose more clearly.

The latter does nothing for now, but its existence means
that applications can request precomputation when appropriate.

multiplication of an arbitrary number of points.

and an ectest.c that actually tests something.

Change mkerr.pl so that it puts the ERR_load_..._strings()
prototype in header files that it writes.

including EC arithmetics derived from Lenka Fibikova's code (with some
additional optimizations).

(This will be used for Lim/Lee precomputation data.)

Initial EC_GROUP_new_curve_GFp implementation.

Rename 'EC_GROUP_set'-related functions to names similar to 'EC_GROUP_set_curve'
because they don't care about the generator.

Add new functions.

Add EC vaporware: change relevant Makefiles and add some empty source
files.

"make update".

The computations for which h was used can be done more efficiently
by using BN_rshift1.

use BN_CTX_start/get/end instead of accessing ctx->tos).

Change indentation to "EAY" style.

These new files will not be included literally in OpenSSL, but I intend
to integrate most of their contents.  Most file names will change,
and when the integration is done, the superfluous files will be deleted.

Submitted by: Lenka Fibikova <fibikova@exp-math.uni-essen.de>