| Age | Commit message (Expand) | 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 |
| 2001-02-08 | Change comments. (The expected number of iterations in BN_rand_range | Bodo Möller |
| 2001-02-08 | oops -- remove observation code | Bodo Möller |
| 2001-02-08 | Integrate my implementation of a countermeasure against | Bodo Möller |
| 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 |
| 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 |
| 2000-12-13 | In bn_mul_recursive(), make sure the comba routines are only called | Richard Levitte |
| 2000-12-13 | Rewrite the extension code to use an ASN1_ITEM structure | Dr. Stephen Henson |
| 2000-12-08 | bn_part_sub_word prototype. | Ulf Möller |
| 2000-12-07 | Fix some things that look like bugs. | Bodo Möller |
| 2000-12-07 | TEST_MUL and TEST_SQR added. | Bodo Möller |
| 2000-12-07 | Sign-related fixes (and tests). | Bodo Möller |
| 2000-12-07 | Move 'q->neg = 0' to those places where it is needed | Bodo Möller |
| 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 2000-12-02 | New function BN_bntest_rand() to detect more BN library bugs. | Ulf Möller |
| 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 |
| 2000-11-30 | BN_mod_exp(r,a,p,m,ctx) should not be called with r == p. | Bodo Möller |
| 2000-11-30 | It's "#elif", not "#elsif". | Bodo Möller |
| 2000-11-30 | Changes to Lenka's Montgomery implementation. | Bodo Möller |
| 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 |
| 2000-11-30 | bn_modfs.c is no longer needed, a BN_sqrt implementation | Bodo Möller |
| 2000-11-30 | Fix bntest.c problem -- one of the primes got lost | Bodo Möller |
