Age | Commit message (Collapse) | Author | |
---|---|---|---|
2005-08-23 | avoid potential spurious BN_free() | Bodo Möller | |
Submitted by: David Heine <dlheine@suif.Stanford.EDU> | |||
2005-03-30 | fix header | Nils Larsch | |
2004-03-13 | Convert openssl code not to assume the deprecated form of BN_zero(). | Geoff Thorpe | |
Remove certain redundant BN_zero() initialisations, because BN_CTX_get(), BN_init(), [etc] already initialise to zero. Correct error checking in bn_sqr.c, and be less wishy-wash about how/why the result's 'top' value is set (note also, 'max' is always > 0 at this point). | |||
2003-11-04 | Put the first stage of my bignum debugging adventures into CVS. This code | Geoff Thorpe | |
is itself experimental, and in addition may cause execution to break on existing openssl "bugs" that previously were harmless or at least invisible. | |||
2002-08-02 | remove obsolete part of comment | Bodo Möller | |
2002-08-02 | remove obsoleted disabled code | Bodo Möller | |
2002-08-02 | Change BN_mod_sqrt() so that it verifies that the input value is | Bodo Möller | |
really the square of the return value. | |||
2001-03-08 | Comment | 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 | Faster BN_mod_sqrt algorithm for p == 5 (8). | 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_sqrt | Bodo Möller | |
2000-11-28 | Add bn_kron.c (BN_kronecker), which I forgot in the previous commit. | Bodo Möller | |
Also add the next file in advance so that I can't forget this one :-) |