| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Put the first stage of my bignum debugging adventures into CVS. This code | Geoff Thorpe | 2003-11-04 | 1 | -0/+6 | |
| | | | | | | | is itself experimental, and in addition may cause execution to break on existing openssl "bugs" that previously were harmless or at least invisible. | |||||
| * | Fix some things that look like bugs. | Bodo Möller | 2000-12-07 | 1 | -4/+18 | |
| | | | | | | | 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. | |||||
| * | Move reduction step from BN_mod_exp to BN_mod_exp_mont_word. | Bodo Möller | 2000-11-30 | 1 | -5/+9 | |
| | | | | | | | 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). | |||||
| * | Handle special cases correctly in exponentation functions. | Bodo Möller | 2000-11-30 | 1 | -15/+16 | |
| | | | | | | | test_bn still fails in the BN_sqrt test because small primes appear to turn into zero for no obvious reason, leading to "div by zero" errors. | |||||
| * | BN_sqrt | Bodo Möller | 2000-11-30 | 1 | -8/+31 | |
| | | ||||||
| * | Improve BN_mod_inverse performance. | Bodo Möller | 2000-11-29 | 1 | -1/+1 | |
| | | | | | | Get the BN_mod_exp_mont bugfix (for handling negative inputs) correct this time. | |||||
| * | Timings. | Bodo Möller | 2000-11-28 | 1 | -6/+19 | |
| | | ||||||
| * | modular arithmetics | Bodo Möller | 2000-11-26 | 1 | -31/+25 | |
| | | | | | "make update" | |||||
| * | Constify the BIGNUM routines a bit more. The only trouble were the | Richard Levitte | 2000-11-06 | 1 | -7/+9 | |
| | | | | | | | two functions that did expansion on in parameters (BN_mul() and BN_sqr()). The problem was solved by making bn_dup_expand() which is a mix of bn_expand2() and BN_dup(). | |||||
| * | Merge the engine branch into the main trunk. All conflicts resolved. | Richard Levitte | 2000-10-26 | 1 | -205/+0 | |
| | | | | | At the same time, add VMS support for Rijndael. | |||||
| * | Actually comment out the parts of BN_MOD_MUL_WORD that I inteded to | Bodo Möller | 2000-06-23 | 1 | -1/+1 | |
| | | | | | comment out in the previous commit | |||||
| * | In BN_mod_exp_mont_word, avoid one application of BN_MOD_MUL_WORD, | Bodo Möller | 2000-06-23 | 1 | -14/+51 | |
| | | | | | | and for small 'a' also a couple of calls to BN_mod_mul_montgomery(r, r, r, ...). | |||||
| * | Use BN_CTX_end when exiting early from BN_mod_exp_mont_word because | Bodo Möller | 2000-06-13 | 1 | -0/+3 | |
| | | | | | BN_mod_exp_atalla could be used. | |||||
| * | The atalla functionality doesn't work with the "word" version of | Geoff Thorpe | 2000-06-13 | 1 | -1/+1 | |
| | | | | | BN_mod_exp. Call the regular atalla mod_exp operation instead. | |||||
| * | Slightly faster DSA verification (BN_mod_exp2_mont), | Bodo Möller | 2000-06-08 | 1 | -52/+37 | |
| | | | | | marginally faster BN_mod_exp for 1024 bit exponents. | |||||
| * | Use the equivalent of a sliding window (without precomputation | Bodo Möller | 2000-06-08 | 1 | -14/+93 | |
| | | | | | | | | | | because we're only handling words anyway) in BN_mod_exp_mont_word making it a little faster for very small exponents, and adjust the performance gain estimate in CHANGES according to slightly more thorough measurements. (15% faster than BN_mod_exp_mont for "large" base, 20% faster than BN_mod_exp_mont for small base.) | |||||
| * | Speed up DH with small generator. | Bodo Möller | 2000-06-07 | 1 | -45/+93 | |
| | | ||||||
| * | Add support for Compaq Atalla crypto accelerator. | Ben Laurie | 2000-02-16 | 1 | -0/+190 | |
| | | ||||||
| * | New functions BN_CTX_start(), BN_CTX_get(), BN_CTX_end() to access | Ulf Möller | 2000-02-05 | 1 | -19/+29 | |
| | | | | | | temporary BIGNUMs. BN_CTX still uses a fixed number of BIGNUMs, but the BN_CTX implementation could now easily be changed. | |||||
| * | Some constification and stacks that slipped through the cracks (how?). | Ben Laurie | 1999-06-04 | 1 | -6/+9 | |
| | | ||||||
| * | Change functions to ANSI C. | Ulf Möller | 1999-04-19 | 1 | -37/+9 | |
| | | ||||||
| * | Fixes to BN code. Previously the default was to define BN_RECURSION | Mark J. Cox | 1999-01-28 | 1 | -9/+14 | |
| | | | | | | | | | | but the BN code had some problems that would cause failures when doing certificate verification and some other functions. Submitted by: Eric A Young from a C2Net version of SSLeay Reviewed by: Mark J Cox PR: | |||||
| * | Import of old SSLeay release: SSLeay 0.9.1b (unreleased) | Ralf S. Engelschall | 1998-12-21 | 1 | -65/+81 | |
| | | ||||||
| * | Import of old SSLeay release: SSLeay 0.9.0b | Ralf S. Engelschall | 1998-12-21 | 1 | -12/+55 | |
| | | ||||||
| * | Import of old SSLeay release: SSLeay 0.8.1b | Ralf S. Engelschall | 1998-12-21 | 1 | -0/+510 | |
 |
index : openssl.git | |
| rhe's working repository |
| aboutsummaryrefslogtreecommitdiffstats |