Age | Commit message (Collapse) | Author | |
---|---|---|---|
2001-02-10 | Simplify BN_rand_range | Bodo Möller | |
2001-02-08 | Another comment change. (Previous comment does not apply | Bodo Möller | |
for range = 11000000... or range = 100000...) | |||
2001-02-08 | Change comments. (The expected number of iterations in BN_rand_range | Bodo Möller | |
never exceeds 1.333...). | |||
2001-02-08 | oops -- remove observation code | Bodo Möller | |
2001-02-08 | Integrate my implementation of a countermeasure against | Bodo Möller | |
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 | |
2001-01-23 | There is no C version of bn_div_3_words | Ulf Möller | |
2000-12-15 | The C version of bn_sub_part_words is needed not only | Bodo Möller | |
in NO_ASM configurations | |||
2000-12-15 | Very few in the "README" is up-to-date | Bodo Möller | |
2000-12-14 | The BN_mul bug test apparently is no longer needed | Bodo Möller | |
2000-12-13 | Problem: bn_mul_normal() misbehaves if the size of b is 0. | Richard Levitte | |
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 | |
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 | |
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 | |
2000-12-07 | Fix some things that look like bugs. | Bodo Möller | |
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 | |
2000-12-07 | Sign-related fixes (and tests). | Bodo Möller | |
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 | |
(just in cases someone uses a negative modulus) | |||
2000-12-06 | BN_mod_sqrt documentation/comment | Bodo Möller | |
2000-12-06 | remove a comment that shouldn't have been there any more | Ulf Möller | |
2000-12-06 | Faster BN_mod_sqrt algorithm for p == 5 (8). | Bodo Möller | |
2000-12-06 | Use bc's "print" feature whenever it is available, | Bodo Möller | |
not just on certain platforms. | |||
2000-12-06 | remove useless instruction | Ulf Möller | |
2000-12-06 | Intel assembler version for bn_sub_part_words(). I haven't got | Ulf Möller | |
reliable timings yet, please try it out! | |||
2000-12-06 | test_mod_mul is useful, let's run it more often. | Ulf Möller | |
2000-12-05 | Use assert as in the rest of the BN library. | Ulf Möller | |
2000-12-04 | Remove the last bn_wexpand()s that made us break constness. Of | 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! | |||
2000-12-04 | Change error message to "bignum too long" | Bodo Möller | |
2000-12-03 | include <limits.h> | Bodo Möller | |
2000-12-03 | Don't allow BIGNUMs to become so large that computations with dmax | Bodo Möller | |
might overflow. | |||
2000-12-02 | Add a comment to explain the purpose of bn_cmp_part_words(). | Richard Levitte | |
2000-12-02 | last commit was wrong. Now it works. :) | Ulf Möller | |
2000-12-02 | argl | Ulf Möller | |
2000-12-02 | forgot to remove the loop variable | Ulf Möller | |
2000-12-02 | Loops like this one: | Ulf Möller | |
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. | |||
2000-12-02 | New function BN_bntest_rand() to detect more BN library bugs. | Ulf Möller | |
The bn_cmp_part_words bug was only caught in the BN_mod_mul() test, not in the BN_mul() test, so apparently the choice of parameters in some cases is bad. | |||
2000-12-02 | Fix bn_cmp_part_words() and move it to bn_lib.c. | Ulf Möller | |
2000-12-01 | functionality for BN_mod_sqrt timings | Bodo Möller | |
2000-12-01 | "make depend" | Bodo Möller | |
2000-11-30 | Fix the recently introduced test that checks if the result is 0 | Bodo Möller | |
2000-11-30 | Fix BN_rshift, which caused lots of trouble. | Bodo Möller | |
2000-11-30 | Remove randomness from the test. These constants give me a segment | Bodo Möller | |
violation in test_kron on a 32 bit system. | |||
2000-11-30 | BN_mod_exp(r,a,p,m,ctx) should not be called with r == p. | Bodo Möller | |
But even if this is avoided, there are still segmentation violations (during one of the BN_free()s at the end of test_kron in some cases, in other cases during BN_kronecker, or later in BN_sqrt; choosing a different exponentiation algorithm in bntest.c appears to influence when the SIGSEGV takes place). | |||
2000-11-30 | It's "#elif", not "#elsif". | Bodo Möller | |
2000-11-30 | Changes to Lenka's Montgomery implementation. | Bodo Möller | |
Submitted by: Lenka Fibikova | |||
2000-11-30 | Corrections to the comments in BN_mod_inverse. | Bodo Möller | |
2000-11-30 | BN_mod_exp problems ... | Bodo Möller | |
2000-11-30 | Move reduction step from BN_mod_exp to BN_mod_exp_mont_word. | Bodo Möller | |
Fix BN_mod_exp_simple for a==0 (mod m). Skip useless round in BN_mod_sqrt (1 is always a square, no need to test BN_kronecker for it). | |||
2000-11-30 | bn_modfs.c is no longer needed, a BN_sqrt implementation | Bodo Möller | |
exists in bn_sqrt.c now | |||
2000-11-30 | Fix bntest.c problem -- one of the primes got lost | Bodo Möller | |