Lines Matching full:bug
3 -- Fixed bug in fast_s_mp_mul_high_digs() which overflowed (line 83), thanks Valgrind!
36 -- Fixed bug in invmod not handling negative inputs correctly [Wolfgang Ehrhardt]
41 -- Fixed bug in comba that would lead to possible erroneous outputs when "pa < digs"
42 -- Fixed bug in mp_toradix_size for "0" [Kevin Kenny]
55 bug reports but new algorithms will have to wait.
59 -- Fixed bug in mp_prime_random_ex() which would set the most significant byte to zero when
61 -- Fixed overflow [minor] bug in fast_s_mp_sqr()
63 -- Fixed "final carry" bug in comba multipliers. (Volkan Ceylan)
85 -- "Wolfgang Ehrhardt" <Wolfgang.Ehrhardt@munich.netsurf.de> found a bug in mp_mul() where if
88 [this also means that I fixed a bug where if sizeof(int) < sizeof(mp_digit) it would bug]
101 I've cleaned them all up to be a little more consistent [along with one bug fix] for this release.
134 -- fixed bug in fast_mp_invmod(). The initial testing logic was wrong. An invalid input is not when
147 -- Henrik Goldman found a buffer overflow bug in mp_add_d(). Fixed.
152 -- Martin Marcel noticed a bug in mp_neg() that allowed negative zeroes.
154 -- Martin Marcel noticed an optimization [and slight bug] in mp_lcm().
186 -- Fixed a bug in next_prime() where an input of zero would be treated as odd and
188 -- fixed a bug in prime_fermat() and prime_miller_rabin() which allowed the base
208 -- Fixed a bug in both mp_invmod() and fast_mp_invmod() which tested for odd
212 v0.21 -- Fixed bug in mp_mul_d which would not handle sign correctly [would not always forward it]
220 v0.19 -- Fixed a bug in mp_montgomery_reduce() which was introduced when I tweaked mp_rshd() in the previous release.
227 v0.18 -- Fixed a bug in s_mp_sqr which would handle carries properly just not very elegantly.
229 -- Fixed bug in mp_sqr which still had a 512 constant instead of MP_WARRAY
242 -- Fixed bug in mp_exptmod that would cause it to fail for odd moduli when DIGIT_BIT != 28
248 bug in the mp_mul() which would erroneously avoid the faster multiplier [comba] when it was
249 allowed. The bug would not cause the incorrect value to be produced just less efficient (fixed)
250 -- Fixed similar bug in the Montgomery reduction code.
265 -- Fixed a bug in mp_sub and mp_add where "-a - -a" or "-a + a" would produce -0 as the result [obviously invalid].
266 -- Fixed a bug in mp_rshd. If the count == a.used it should zero/return [instead of shifting]
267 -- Fixed a "off-by-one" bug in mp_mul2d. The initial size check on alloc would be off by one if the residue
269 -- Fixed a bug where s_mp_mul_digs() would not call the Comba based routine if allowed. This made Barrett reduction
353 -- Fixed a bug in mp_invmod w.r.t. even moduli
357 -- Note there is a slight "off-by-one" bug in the library somewhere
367 -- Fixed bug in mp_div
373 -- Fixed a bug where mp_set_int wouldn't zero the value first and set the used member.
374 -- fixed a bug in s_mp_mul_high_digs where the limit placed on the result digits was not calculated properly
376 -- fixed a bug in mp_mod and mp_mod_d concerning negative inputs
