- 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
-
Richard Levitte authored
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
-
- Nov 28, 2002
-
-
Richard Levitte authored
always give the expected result on some platforms.
-
Richard Levitte authored
-
Richard Levitte authored
I've covered all the memset()s I felt safe modifying, but may have missed some.
-
- Nov 27, 2002
-
-
Richard Levitte authored
-
Richard Levitte authored
-
Richard Levitte authored
and linker optimizations. PR: 343
-
- Nov 26, 2002
-
-
Richard Levitte authored
-
Richard Levitte authored
incorrect. Fortunately, there is a second check that's correct, when adding the pads. PR: 355
-
Richard Levitte authored
to force the use of Heimdal, and warn if that's used. PR: 346
-
Richard Levitte authored
PR: 349
-
Richard Levitte authored
to force the use of Heimdal, and warn if that's used. PR: 346
-
- Nov 23, 2002
-
-
Bodo Möller authored
Submitted by: Sheueling Chang
-
- Nov 22, 2002
-
-
Bodo Möller authored
-
Richard Levitte authored
-
Richard Levitte authored
-
- Nov 21, 2002
-
-
Richard Levitte authored
-
- Nov 20, 2002
-
-
Bodo Möller authored
Submitted by: Nils Larsch
-
Bodo Möller authored
for Montgomery representations. Submitted by: Sheueling Chang, Bodo Moeller
-
Lutz Jänicke authored
caching (#288): now internal caching failed (#351): Make sure, that cipher_id is set before comparing. Submitted by: Reviewed by: PR: 288 (and 351)
-
- Nov 19, 2002
-
-
Bodo Möller authored
(we can't release it before the CRYPTO_mem_leaks() call!) Submitted by: Nils Larsch
-
Richard Levitte authored
-
Richard Levitte authored
-
Richard Levitte authored
-
Richard Levitte authored
-
- Nov 18, 2002
-
-
Richard Levitte authored
-
Richard Levitte authored
-
Richard Levitte authored
defined as follows (according to X.509_4thEditionDraftV6.pdf): CertificatePair ::= SEQUENCE { forward [0] Certificate OPTIONAL, reverse [1] Certificate OPTIONAL, -- at least one of the pair shall be present -- } The only thing I'm not sure about is if it's implicit or explicit tags that I should count on. For now, I'm thinking explicit, but will gladly stand corrected. Also implement the PEM functions to read and write certificate pairs, and defined the PEM tag as "CERTIFICATE PAIR". This needed to be defined, mostly for the sake of the LDAP attribute crossCertificatePair, but may prove useful elsewhere as well.
-
Richard Levitte authored
-
Richard Levitte authored
-