Submitted by: Nils Larsch <nla@trustcenter.de>

Submitted by: Nils Larsch <nla@trustcenter.de>

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.

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

"make update".

sure they are available in opensslconf.h, by giving them names starting
with "OPENSSL_" to avoid conflicts with other packages and by making
sure e_os2.h will cover all platform-specific cases together with
opensslconf.h.

I've checked fairly well that nothing breaks with this (apart from
external software that will adapt if they have used something like
NO_KRB5), but I can't guarantee it completely, so a review of this
change would be a good thing.

codebase apparently was inconsistent.  And crypto/Makefile.ssl
*does* need an ERRC ..
Submitted by:
Reviewed by:
PR:

script, translates function codes better and doesn't need the K&R function
prototypes to work (NB. the K&R prototypes can't be wiped just yet: they are
still needed by the DEF generator...). I also ran the script with the -rewrite
option to update all the header and source files.

Submitted by:
Reviewed by:
PR:

(Pointed out by Carlos Amengual).