Skip to content
  1. Dec 07, 2000
    • Bodo Möller's avatar
      Fix some things that look like bugs. · 8dea52fa
      Bodo Möller authored
      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.
      8dea52fa
    • Bodo Möller's avatar
      Sign-related fixes (and tests). · 80d89e6a
      Bodo Möller authored
      BN_mod_exp_mont does not work properly yet if modulus m
      is negative (we want computations to be carried out
      modulo |m|).
      80d89e6a
  2. Dec 06, 2000
  3. Dec 04, 2000
  4. Dec 02, 2000
  5. Dec 01, 2000
  6. Nov 30, 2000
  7. Nov 29, 2000
  8. Nov 28, 2000
  9. Nov 27, 2000
  10. Nov 26, 2000
  11. Nov 18, 2000
    • Richard Levitte's avatar
      Remove two bn_wexpand() from BN_mul(), which is a step toward getting · baa257f1
      Richard Levitte authored
      BN_mul() correctly constified, avoids two realloc()'s that aren't
      really necessary and saves memory to boot.  This required a small
      change in bn_mul_part_recursive() and the addition of variants of
      bn_cmp_words(), bn_add_words() and bn_sub_words() that can take arrays
      with differing sizes.
      
      The test results show a performance that very closely matches the
      original code from before my constification.  This may seem like a
      very small win from a performance point of view, but if one remembers
      that the variants of bn_cmp_words(), bn_add_words() and bn_sub_words()
      are not at all optimized for the moment (and there's no corresponding
      assembler code), and that their use may be just as non-optimal, I'm
      pretty confident there are possibilities...
      
      This code needs reviewing!
      baa257f1
  12. Nov 17, 2000
  13. Nov 08, 2000
  14. Nov 07, 2000
  15. Nov 06, 2000
  16. Nov 02, 2000