- 13 12月, 2000 1 次提交
-
-
由 Dr. Stephen Henson 提交于
Rewrite the extension code to use an ASN1_ITEM structure for its ASN1 operations as well as the old style function pointers (i2d, d2i, new, free). Change standard extensions to support this. Fix a warning in BN_mul(), bn_mul.c about uninitialised 'j'.
-
- 06 12月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
reliable timings yet, please try it out!
-
- 05 12月, 2000 2 次提交
-
-
由 Ulf Möller 提交于
-
由 Richard Levitte 提交于
course, that means we need to handle the cases where the two arrays to bn_mul_recursive() and bn_mul_part_recursive() differ in size. I haven't yet changed the comments that describe bn_mul_recursive() and bn_mul_part_recursive(). I want this to be tested by more people before I consider this change final. Please test away!
-
- 02 12月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 01 12月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
-
- 29 11月, 2000 1 次提交
-
-
由 Richard Levitte 提交于
bn_add_words(), not bn_sub_words()...
-
- 22 11月, 2000 1 次提交
-
-
由 Richard Levitte 提交于
-
- 19 11月, 2000 1 次提交
-
-
由 Richard Levitte 提交于
BN_mul() correctly constified, avoids two realloc()'s that aren't really necessary and saves memory to boot. This required a small change in bn_mul_part_recursive() and the addition of variants of bn_cmp_words(), bn_add_words() and bn_sub_words() that can take arrays with differing sizes. The test results show a performance that very closely matches the original code from before my constification. This may seem like a very small win from a performance point of view, but if one remembers that the variants of bn_cmp_words(), bn_add_words() and bn_sub_words() are not at all optimized for the moment (and there's no corresponding assembler code), and that their use may be just as non-optimal, I'm pretty confident there are possibilities... This code needs reviewing!
-
- 17 11月, 2000 1 次提交
-
-
由 Richard Levitte 提交于
stdout. bc gets so confused by bean counts.
-
- 07 11月, 2000 1 次提交
-
-
由 Richard Levitte 提交于
two functions that did expansion on in parameters (BN_mul() and BN_sqr()). The problem was solved by making bn_dup_expand() which is a mix of bn_expand2() and BN_dup().
-
- 26 7月, 2000 1 次提交
-
-
由 Richard Levitte 提交于
that of the result pointer to bn_mul was the same as one of the two arguments, That argument might have it's sign destroyed. He provided this fix.
-
- 02 3月, 2000 2 次提交
-
-
由 Bodo Möller 提交于
-
由 Ulf Möller 提交于
-
- 27 2月, 2000 2 次提交
-
-
由 Ulf Möller 提交于
-
由 Ulf Möller 提交于
-
- 05 2月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
temporary BIGNUMs. BN_CTX still uses a fixed number of BIGNUMs, but the BN_CTX implementation could now easily be changed.
-
- 04 2月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 27 7月, 1999 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 20 4月, 1999 1 次提交
-
-
由 Ulf Möller 提交于
-
- 28 1月, 1999 1 次提交
-
-
由 Mark J. Cox 提交于
but the BN code had some problems that would cause failures when doing certificate verification and some other functions. Submitted by: Eric A Young from a C2Net version of SSLeay Reviewed by: Mark J Cox PR:
-
- 22 12月, 1998 1 次提交
-
-
由 Ralf S. Engelschall 提交于
-
- 21 12月, 1998 3 次提交
-
-
由 Ralf S. Engelschall 提交于
-
由 Ralf S. Engelschall 提交于
-
由 Ralf S. Engelschall 提交于
-