- Dec 06, 2002
-
-
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.
-
Richard Levitte authored
-
Richard Levitte authored
proper implementation of bn_div_words() for VAX. If the tests go through well, the next step will be to test on Alpha.
-
- Dec 01, 2002
-
-
Richard Levitte authored
PR: 366
-
Richard Levitte authored
-
Richard Levitte authored
PR: 366
-
- Nov 29, 2002
-
-
Richard Levitte authored
PR: 360
-
Richard Levitte authored
symlink to said manpage. PR: 242
-
Richard Levitte authored
-