- Dec 08, 2002
-
-
Geoff Thorpe authored
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.
-
Geoff Thorpe authored
-
Richard Levitte authored
ZLIB a known compression method, with the identity 1.
-
Richard Levitte authored
stateless variant is kept, but isn't used anywhere.
-
- Dec 07, 2002
-
-
Richard Levitte authored
-
Richard Levitte authored
-
- Dec 06, 2002
-
-
Andy Polyakov authored
Submitted by: <appro> Reviewed by: PR:
-
Richard Levitte authored
anything.
-
Richard Levitte authored
compatible, don't use ==, use = instead...
-
Richard Levitte authored
-
- Dec 05, 2002
-
-
Richard Levitte authored
-
Richard Levitte authored
-
Richard Levitte authored
a first alternative to try
-
Richard Levitte authored
-
Andy Polyakov authored
Submitted by: Reviewed by: PR:
-
Richard Levitte authored
-
Richard Levitte authored
-
Richard Levitte authored
-
Richard Levitte authored
PR: 380
-
Richard Levitte authored
PR: 376
-
Richard Levitte authored
well to be able to use the CHIL engine. PR: 281
-
Richard Levitte authored
-
Richard Levitte authored
PR: 381
-
- Dec 04, 2002
-
-
Richard Levitte authored
rule for SHA stuff. PR: 381
-
Richard Levitte authored
PR: 379
-
Richard Levitte authored
-
Bodo Möller authored
(length of the order of the group, not length of the actual key, which will be shorter in some cases). Submitted by: Nils Larsch
-
Bodo Möller authored
Include X9.62 signature examples. Submitted by: Nils Larsch
-
Lutz Jänicke authored
Submitted by: Christian Hohnstaedt <chohnstaedt@innominate.com> Reviewed by: PR:
-
Richard Levitte authored
PR: 347
-
Richard Levitte authored
PR: 348
-
Richard Levitte authored
PR: 375
-
Dr. Stephen Henson authored
Make ASN1_TYPE_get() work for V_ASN1_NULL type.
-
Dr. Stephen Henson authored
-
- Dec 03, 2002
-
-
Dr. Stephen Henson authored
return the requested number of bytes when reading content.
-
Richard Levitte authored
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)
-
Richard Levitte authored
-
Richard Levitte authored
-
- Dec 02, 2002
-
-
Richard Levitte authored
gets defined). PR: 371
-
Richard Levitte authored
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.
-