| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2001-03-09 | Bug fixes. | Richard Levitte | 1 | -7/+8 | |
| 2001-03-08 | Implement EC_GFp_mont_method. | Bodo Möller | 1 | -3/+3 | |
| 2001-03-08 | Comment | Bodo Möller | 1 | -0/+2 | |
| 2001-03-08 | Hide BN_CTX structure details. | Bodo Möller | 4 | -18/+29 | |
| Incease the number of BIGNUMs in a BN_CTX. | |||||
| 2001-03-08 | Constify BN_value_one. | Bodo Möller | 2 | -2/+2 | |
| 2001-03-08 | More method functions for EC_GFp_simple_method. | Bodo Möller | 1 | -1/+0 | |
| 2001-03-07 | Code for better build under Darwin (MacOS X). | Richard Levitte | 2 | -2/+2 | |
| Submitted by Brad Dominy <jdominy@darwinuser.org> | |||||
| 2001-02-28 | Fix a bug which caused BN_div to produce the | Dr. Stephen Henson | 1 | -1/+5 | |
| wrong result if rm==num and num < 0. | |||||
| 2001-02-22 | e_os.h does not belong with the exported headers. Do not put it there | Richard Levitte | 2 | -123/+118 | |
| and make all files the depend on it include it without prefixing it with openssl/. This means that all Makefiles will have $(TOP) as one of the include directories. | |||||
| 2001-02-22 | Use e_os2.h rather than opensslconf.h, since some needed macros are | Richard Levitte | 1 | -1/+1 | |
| defined there. | |||||
| 2001-02-20 | Use new-style system-id macros everywhere possible. I hope I haven't | Richard Levitte | 5 | -7/+7 | |
| missed any. This compiles and runs on Linux, and external applications have no problems with it. The definite test will be to build this on VMS. | |||||
| 2001-02-20 | Fix BN_[pseudo_]rand: 'mask' must be used even if top=-1. | Bodo Möller | 1 | -4/+3 | |
| Mention BN_[pseudo_]rand with top=-1 in CHANGES. | |||||
| 2001-02-20 | Use new-style system-id macros. | Richard Levitte | 1 | -1/+1 | |
| 2001-02-20 | BN_rand_range() needs a BN_rand() variant that doesn't set the MSB. | Ulf Möller | 1 | -12/+15 | |
| 2001-02-19 | Make all configuration macros available for application by making | Richard Levitte | 9 | -44/+49 | |
| sure they are available in opensslconf.h, by giving them names starting with "OPENSSL_" to avoid conflicts with other packages and by making sure e_os2.h will cover all platform-specific cases together with opensslconf.h. I've checked fairly well that nothing breaks with this (apart from external software that will adapt if they have used something like NO_KRB5), but I can't guarantee it completely, so a review of this change would be a good thing. | |||||
| 2001-02-10 | Simplify BN_rand_range | Bodo Möller | 2 | -8/+4 | |
| 2001-02-08 | Another comment change. (Previous comment does not apply | Bodo Möller | 1 | -2/+2 | |
| for range = 11000000... or range = 100000...) | |||||
| 2001-02-08 | Change comments. (The expected number of iterations in BN_rand_range | Bodo Möller | 1 | -2/+2 | |
| never exceeds 1.333...). | |||||
| 2001-02-08 | oops -- remove observation code | Bodo Möller | 1 | -4/+0 | |
| 2001-02-08 | Integrate my implementation of a countermeasure against | Bodo Möller | 3 | -7/+60 | |
| Bleichenbacher's DSA attack. With this implementation, the expected number of iterations never exceeds 2. New semantics for BN_rand_range(): BN_rand_range(r, min, range) now generates r such that min <= r < min+range. (Previously, BN_rand_range(r, min, max) generated r such that min <= r < max. It is more convenient to have the range; also the previous prototype was misleading because max was larger than the actual maximum.) | |||||
| 2001-02-07 | Bleichenbacher's DSA attack | Ulf Möller | 2 | -0/+12 | |
| 2001-01-23 | There is no C version of bn_div_3_words | Ulf Möller | 1 | -1/+1 | |
| 2000-12-15 | The C version of bn_sub_part_words is needed not only | Bodo Möller | 1 | -1/+1 | |
| in NO_ASM configurations | |||||
| 2000-12-15 | Very few in the "README" is up-to-date | Bodo Möller | 1 | -0/+4 | |
| 2000-12-14 | The BN_mul bug test apparently is no longer needed | Bodo Möller | 1 | -37/+0 | |
| 2000-12-13 | Problem: bn_mul_normal() misbehaves if the size of b is 0. | Richard Levitte | 1 | -1/+7 | |
| Solution: multiply a with 0, putting the result in r, and return. | |||||
| 2000-12-13 | In bn_mul_recursive(), make sure the comba routines are only called | Richard Levitte | 1 | -4/+7 | |
| when both a and b are of the exact right size. This may change to something better later. | |||||
| 2000-12-13 | Rewrite the extension code to use an ASN1_ITEM structure | Dr. Stephen Henson | 1 | -1/+1 | |
| 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'. | |||||
| 2000-12-08 | bn_part_sub_word prototype. | Ulf Möller | 1 | -0/+2 | |
| 2000-12-07 | Fix some things that look like bugs. | Bodo Möller | 5 | -47/+111 | |
| One problem that looked like a problem in bn_recp.c at first turned out to be a BN_mul bug. An example is given in bn_recp.c; finding the bug responsible for this is left as an exercise. | |||||
| 2000-12-07 | TEST_MUL and TEST_SQR added. | Bodo Möller | 1 | -2/+24 | |
| 2000-12-07 | Sign-related fixes (and tests). | Bodo Möller | 3 | -17/+30 | |
| BN_mod_exp_mont does not work properly yet if modulus m is negative (we want computations to be carried out modulo |m|). | |||||
| 2000-12-07 | Move 'q->neg = 0' to those places where it is needed | Bodo Möller | 1 | -1/+5 | |
| (just in cases someone uses a negative modulus) | |||||
| 2000-12-06 | BN_mod_sqrt documentation/comment | Bodo Möller | 1 | -1/+1 | |
| 2000-12-06 | remove a comment that shouldn't have been there any more | Ulf Möller | 1 | -1/+1 | |
| 2000-12-06 | Faster BN_mod_sqrt algorithm for p == 5 (8). | Bodo Möller | 1 | -5/+79 | |
| 2000-12-06 | Use bc's "print" feature whenever it is available, | Bodo Möller | 1 | -2/+0 | |
| not just on certain platforms. | |||||
| 2000-12-06 | remove useless instruction | Ulf Möller | 1 | -2/+0 | |
| 2000-12-06 | Intel assembler version for bn_sub_part_words(). I haven't got | Ulf Möller | 2 | -2/+215 | |
| reliable timings yet, please try it out! | |||||
| 2000-12-06 | test_mod_mul is useful, let's run it more often. | Ulf Möller | 1 | -1/+3 | |
| 2000-12-05 | Use assert as in the rest of the BN library. | Ulf Möller | 1 | -0/+5 | |
| 2000-12-04 | Remove the last bn_wexpand()s that made us break constness. Of | Richard Levitte | 2 | -54/+94 | |
| 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! | |||||
| 2000-12-04 | Change error message to "bignum too long" | Bodo Möller | 3 | -3/+3 | |
| 2000-12-03 | include <limits.h> | Bodo Möller | 1 | -0/+1 | |
| 2000-12-03 | Don't allow BIGNUMs to become so large that computations with dmax | Bodo Möller | 3 | -0/+8 | |
| might overflow. | |||||
| 2000-12-02 | Add a comment to explain the purpose of bn_cmp_part_words(). | Richard Levitte | 1 | -0/+7 | |
| 2000-12-02 | last commit was wrong. Now it works. :) | Ulf Möller | 1 | -2/+2 | |
| 2000-12-02 | argl | Ulf Möller | 1 | -1/+1 | |
| 2000-12-02 | forgot to remove the loop variable | Ulf Möller | 1 | -8/+0 | |
| 2000-12-02 | Loops like this one: | Ulf Möller | 1 | -28/+0 | |
| if (bp == NULL) for (j=0; j<10000; j++) BN_add(&c,&a,&b); seem to be pretty useless, and bp never is NULL anyway. | |||||
 |
index : rocket-tools/riscv-gnu-toolchain/qemu/roms/edk2/CryptoPkg/Library/OpensslLib/openssl.git | |
| Unnamed repository; edit this file 'description' to name the repository. | root |
| aboutsummaryrefslogtreecommitdiff |