verification step of CRT private key operations in the RSA code -
previously no montgomery form was checked or used for 'n', and so it would
be generated on the fly each time. As a result, private key operations are
now a percent or two faster.

Rather than adding this as another repetition of the nearly-identical
montgomery "check for first-use" initialisation code blocks, I've taken
this chance to create a helper function and macro-wrapper to replace them.

PR: 475

PR: 454

on it.

I also updated the bn_ops field with values taken from OpenBSD-mips.
PR: 498

PR: 500

PR: 500

PR: 358

applications, at least on the platforms where it's known how
to do it.

Note: this has only been tested on GNU-based platforms (Linux), and
needs to be tested on all others.  Additionally, it's not yet
supported on the following platforms, for lack of information:

Darwin (MacOS X)
Cygwin
OSF1/Alpha
SVR3
ReliantUNIX

Please help out with testing and the platforms we don't yet know well
enough.

Submitted by: Nils Larsch

efficiency (EC_PRE_COMP objects are now constant once completed).

Extend 'extra_data' API to support arbitrarily many slots (although we
need only one at the moment).

Modify EC internal 'extra_data' API: EC_GROUP_[clear_]free_extra_data
now frees only a single slot (the previous functions are available as
EC_GROUP_[clear_]free_all_extra_data).

Submitted by: Nils Larsch
Reviewed by: Bodo Moeller

mit_des_cbc_cksum().  The difference was first observed, then verified by
looking at the MIT source.

Submitted by: Nils Larsch

Submitted by: Nils Larsch

Submitted by: Nils Larsch
Reviewed by: Bodo Moeller

Submitted by: Toni Andjelkovic <toni@soth.at>

- OpenSSL version differences
- Sun /dev/urandom patch information

let's make that a void *.  Also, BIO_socket_nbio() should send it an int
argument, not a long.
PR: 457

PR: 424

PR: 364

PR: 327

PR: 327

PR: 327