- a patch to fix a memory leak in rsa_gen.c
  - a note about compiler warnings with unions
  - a note about improving structure element names

This applies his patch and implements a solution to the notes.

key-generation and prime-checking functions. Rather than explicitly passing
callback functions and caller-defined context data for the callbacks, a new
structure BN_GENCB is defined that encapsulates this; a pointer to the
structure is passed to all such functions instead.

This wrapper structure allows the encapsulation of "old" and "new" style
callbacks - "new" callbacks return a boolean result on the understanding
that returning FALSE should terminate keygen/primality processing.  The
BN_GENCB abstraction will allow future callback modifications without
needing to break binary compatibility nor change the API function
prototypes. The new API functions have been given names ending in "_ex" and
the old functions are implemented as wrappers to the new ones.  The
OPENSSL_NO_DEPRECATED symbol has been introduced so that, if defined,
declaration of the older functions will be skipped. NB: Some
openssl-internal code will stick with the older callbacks for now, so
appropriate "#undef" logic will be put in place - this is in case the user
is *building* openssl (rather than *including* its headers) with this
symbol defined.

There is another change in the new _ex functions; the key-generation
functions do not return key structures but operate on structures passed by
the caller, the return value is a boolean. This will allow for a smoother
transition to having key-generation as "virtual function" in the various
***_METHOD tables.

stateless variant is kept, but isn't used anywhere.

Submitted by: <appro>
Reviewed by:
PR:

anything.

a first alternative to try

PR: 376

PR: 381

rule for SHA stuff.
PR: 381

(length of the order of the group, not length of the actual key, which
will be shorter in some cases).

Submitted by: Nils Larsch

Include X9.62 signature examples.

Submitted by: Nils Larsch

Make ASN1_TYPE_get() work for V_ASN1_NULL type.

return the requested number of bytes when reading
content.

the divisor was a bit more complex than I first saw.  The lost bit
can't just be discarded, as there are cases where it is important.
For example, look at dividing 320000 with 80000 vs. 80001 (all
decimals), the difference is crucial.  The trick here is to check if
that lost bit was 1, and in that case, do the following:

1. subtract the quotient from the remainder
2. as long as the remainder is negative, add the divisor (the whole
   divisor, not the shofted down copy) to it, and decrease the
   quotient by one.

There's probably a nice mathematical proof for this already, but I
won't bother with that, unless someone requests it from me.

proper implementation of bn_div_words() for VAX.

If the tests go through well, the next step will be to test on Alpha.

PR: 366

PR: 366

PR: 360

I *think* I got them all covered by now, bu please, if you find any more,
tell me and I'll correct it.
PR: 343

always give the expected result on some platforms.

I've covered all the memset()s I felt safe modifying, but may have missed some.

and linker optimizations.
PR: 343

incorrect.  Fortunately, there is a second check that's correct, when adding
the pads.
PR: 355

Submitted by: Sheueling Chang

Submitted by: Nils Larsch

for Montgomery representations.

Submitted by: Sheueling Chang, Bodo Moeller

defined as follows (according to X.509_4thEditionDraftV6.pdf):

CertificatePair ::= SEQUENCE {
	forward		[0]	Certificate OPTIONAL,
	reverse		[1]	Certificate OPTIONAL,
	-- at least one of the pair shall be present -- }

The only thing I'm not sure about is if it's implicit or explicit tags
that I should count on.  For now, I'm thinking explicit, but will
gladly stand corrected.

Also implement the PEM functions to read and write certificate pairs,
and defined the PEM tag as "CERTIFICATE PAIR".

This needed to be defined, mostly for the sake of the LDAP attribute
crossCertificatePair, but may prove useful elsewhere as well.