Submitted by: <appro>
Reviewed by:
PR:

anything.

compatible, don't use ==, use = instead...

a first alternative to try

Submitted by:
Reviewed by:
PR:

PR: 380

PR: 376

well to be able to use the CHIL engine.
PR: 281

PR: 381

rule for SHA stuff.
PR: 381

PR: 379

(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

Submitted by: Christian Hohnstaedt <chohnstaedt@innominate.com>
Reviewed by:
PR:

PR: 347

PR: 348

PR: 375

Make ASN1_TYPE_get() work for V_ASN1_NULL type.

return the requested number of bytes when reading
content.

exit() in whatever way works for the intended platform, and define
OPENSSL_EXIT() to have the old meaning (the name is of course because
it's only used in the openssl program)

gets defined).
PR: 371

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