- 21 12月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
-
- 15 12月, 2002 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 09 12月, 2002 2 次提交
-
-
由 Richard Levitte 提交于
-
由 Geoff Thorpe 提交于
- 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.
-
- 08 12月, 2002 1 次提交
-
-
由 Geoff Thorpe 提交于
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.
-
- 03 12月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
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.
-
- 02 12月, 2002 2 次提交
-
-
由 Richard Levitte 提交于
-
由 Richard Levitte 提交于
proper implementation of bn_div_words() for VAX. If the tests go through well, the next step will be to test on Alpha.
-
- 01 12月, 2002 2 次提交
-
-
由 Richard Levitte 提交于
PR: 366
-
由 Richard Levitte 提交于
PR: 366
-
- 29 11月, 2002 2 次提交
-
-
由 Richard Levitte 提交于
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
-
由 Richard Levitte 提交于
always give the expected result on some platforms.
-
- 27 11月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
-
- 19 11月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
-
- 14 11月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
PR: 338 Here's the description, submitted by Gisle Vanem <giva@bgnett.no>: 1. sock_init() renamed to ssl_sock_init() in ./apps/s_socket.c due to name-clash with Watt-32. 2. rand() renamed to Rand() in ./crypto/bn/divtest.c due to name-clash with <stdlib.h> 3. Added calls to dbug_init()/sock_init() in some demo programs. 4. Changed cflags/lflags in configure. Watt-32 install root now taken from $WATT_ROOT.
-
- 04 11月, 2002 1 次提交
-
-
由 Bodo Möller 提交于
Submitted by: Nils Larsch
-
- 29 10月, 2002 4 次提交
-
-
由 Richard Levitte 提交于
is something we really need to keep track of!). make update
-
由 Bodo Möller 提交于
Submitted by: Nils Larsch
-
由 Bodo Möller 提交于
Submitted by: Sheueling Chang <Sheueling.Chang@Sun.COM>
-
由 Bodo Möller 提交于
Submitted by: Bodo Moeller
-
- 28 10月, 2002 2 次提交
-
-
由 Bodo Möller 提交于
create new lock CRYPTO_LOCK_BN to avoid race condition
-
由 Bodo Möller 提交于
Submitted by: Nils Larsch
-
- 14 10月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
word, since that word may not be zero.
-
- 09 10月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
give it. For 0.9.7 and up, that means util/domd needs to remove those double dashes from the argument list when gcc is used to find the dependencies.
-
- 27 8月, 2002 1 次提交
-
-
由 Bodo Möller 提交于
Submitted by: Nils Larsch
-
- 13 8月, 2002 1 次提交
-
-
由 Richard Levitte 提交于
PR: 216, point 3
-
- 07 8月, 2002 1 次提交
-
-
由 Bodo Möller 提交于
Submitted by: Nils Larsch, Douglas Stebila
-
- 04 8月, 2002 3 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
and it does not yet work correctly) Submitted by: Douglas Stebila
-
- 03 8月, 2002 2 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
- 02 8月, 2002 7 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
without success.
-
由 Bodo Möller 提交于
really the square of the return value.
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
the new method names where _GF... suffixes have been removed. Revert changes to ..._{get/set}_Jprojective_coordinates_...: The current implementation for ECC over binary fields does not use projective coordinates, and if it did, it would not use Jacobian projective coordinates; so it's OK to use the ..._GFp prefix for all this. Add author attributions to some files so that it doesn't look as if Sun wrote all of this :-)
-
由 Bodo Möller 提交于
The 'OPENSSL_NO_SUN_DIV' default is still subject to change, so I didn't bother to finish the CHANGES entry yet. Submitted by: Douglas Stebila <douglas.stebila@sun.com>, Sheueling Chang <sheueling.chang@sun.com> (CHANGES entry by Bodo Moeller)
-
- 25 7月, 2002 1 次提交
-
-
由 Bodo Möller 提交于
happens reliably, even if the BIGNUM is already sufficiently large. [Note that the bn_expand()/bn_wexpand() macros call bn_expand2() only if the BIGNUM actually has to grow, so this change does not add any new overhead as currently bn_expand2() is never called directly.]
-