Age | Commit message (Collapse) | Author | |
---|---|---|---|
2001-09-03 | Use uniformly chosen witnesses for Miller-Rabin test | Bodo Möller | |
(by using new BN_pseudo_rand_range function) | |||
2001-07-31 | make update | Richard Levitte | |
2001-07-30 | Really add the EVP and all of the DES changes. | Ben Laurie | |
2001-07-30 | Enhanced support for IA-64 Linux and HP-UX (as well as better support for | Andy Polyakov | |
HP-UX in common in ./config). Note that for the moment of this writing none of 64-bit platforms pass bntest. I'm committing this anyway as it's too frustrating to patch snapshots over and over while 0.9.6 is known to work. | |||
2001-07-30 | Support for Intel and HP-UXi assemblers. | Andy Polyakov | |
2001-06-22 | This fixes "Spurious test failures on IRIX?" reported in April. Apparently | Andy Polyakov | |
I was wrong in conclusions about when addition starts overflowing in combaX routines. | |||
2001-06-11 | Get rid of "possible WAW dependency" warnings. | Andy Polyakov | |
Submitted by: Reviewed by: PR: | |||
2001-05-30 | Get rid of RAW dependency warnings. | Andy Polyakov | |
Submitted by: Reviewed by: PR: | |||
2001-05-28 | Assembler support for IA-64. See the source code commentary for further | Andy Polyakov | |
details (performance numbers and accompanying discussions:-). Note that the code is not engaged in ./Configure yet. I'll add it later this week along with updates for .spec file. Submitted by: Reviewed by: PR: | |||
2001-05-14 | branch on equal is beql, not beq... | Richard Levitte | |
2001-04-09 | Adjust BN_mod_inverse algorithm selection according to experiments on | Bodo Möller | |
Ultra-Sparcs (both 32-bit and 64-bit compilations) | |||
2001-04-08 | comment | Bodo Möller | |
2001-04-08 | code documentation | Bodo Möller | |
2001-04-08 | binary algorithm for modular inversion | Bodo Möller | |
2001-03-27 | The IRIX fix. Asm recap and corresponding declation. | Andy Polyakov | |
Submitted by: Reviewed by: PR: | |||
2001-03-15 | Completely remove mont2 stuff. | Bodo Möller | |
It does not appear to be faster than the current Montgomery code except for very small moduli (somewhere between 192 and 224 bits in a 64-bit Sun environment, and even less than 192 bits on 32 bit systems). | |||
2001-03-11 | EC_METHOD based on bn_mont2 (not used in the library) | Bodo Möller | |
2001-03-10 | More EC stuff, including EC_POINTs_mul() for simultaneous scalar | Bodo Möller | |
multiplication of an arbitrary number of points. | |||
2001-03-09 | Instead of telling both 'make' and the user that ranlib | Bodo Möller | |
errors can be tolerated, hide the error from 'make'. This gives shorter output both if ranlib fails and if it works. | |||
2001-03-09 | Bug fixes. | Richard Levitte | |
2001-03-08 | Implement EC_GFp_mont_method. | Bodo Möller | |
2001-03-08 | Comment | Bodo Möller | |
2001-03-08 | Hide BN_CTX structure details. | Bodo Möller | |
Incease the number of BIGNUMs in a BN_CTX. | |||
2001-03-08 | Constify BN_value_one. | Bodo Möller | |
2001-03-08 | More method functions for EC_GFp_simple_method. | Bodo Möller | |
2001-03-07 | Code for better build under Darwin (MacOS X). | Richard Levitte | |
Submitted by Brad Dominy <jdominy@darwinuser.org> | |||
2001-02-28 | Fix a bug which caused BN_div to produce the | Dr. Stephen Henson | |
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 | |
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 | |
defined there. | |||
2001-02-20 | Use new-style system-id macros everywhere possible. I hope I haven't | Richard Levitte | |
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 | |
Mention BN_[pseudo_]rand with top=-1 in CHANGES. | |||
2001-02-20 | Use new-style system-id macros. | Richard Levitte | |
2001-02-20 | BN_rand_range() needs a BN_rand() variant that doesn't set the MSB. | Ulf Möller | |
2001-02-19 | Make all configuration macros available for application by making | Richard Levitte | |
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 | |
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 | |