Mercurial > dropbear

comparison libtommath/changes.txt @ 293:9d110777f345 contrib-blacklist

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
propagate from branch 'au.asn.ucc.matt.dropbear' (head 7ad1775ed65e75dbece27fe6b65bf1a234db386a) to branch 'au.asn.ucc.matt.dropbear.contrib.blacklist' (head 1d86a4f0a401cc68c2670d821a2f6366c37af143)
author Matt Johnston <matt@ucc.asn.au>
date Fri, 10 Mar 2006 06:31:29 +0000
parents eed26cff980b
children 5ff8218bcee9
comparison
equal deleted inserted replaced
247:c07de41b53d7 293:9d110777f345
1 March 12th, 2005
2 v0.35 -- Stupid XOR function missing line again... oops.
3 -- Fixed bug in invmod not handling negative inputs correctly [Wolfgang Ehrhardt]
4 -- Made exteuclid always give positive u3 output...[ Wolfgang Ehrhardt ]
5 -- [Wolfgang Ehrhardt] Suggested a fix for mp_reduce() which avoided underruns. ;-)
6 -- mp_rand() would emit one too many digits and it was possible to get a 0 out of it ... oops
7 -- Added montgomery to the testing to make sure it handles 1..10 digit moduli correctly
8 -- Fixed bug in comba that would lead to possible erroneous outputs when "pa < digs"
9 -- Fixed bug in mp_toradix_size for "0" [Kevin Kenny]
10 -- Updated chapters 1-5 of the textbook ;-) It now talks about the new comba code!
11
12 February 12th, 2005
13 v0.34 -- Fixed two more small errors in mp_prime_random_ex()
14 -- Fixed overflow in mp_mul_d() [Kevin Kenny]
15 -- Added mp_to_(un)signed_bin_n() functions which do bounds checking for ya [and report the size]
16 -- Added "large" diminished radix support. Speeds up things like DSA where the moduli is of the form 2^k - P for some P < 2^(k/2) or so
17 Actually is faster than Montgomery on my AMD64 (and probably much faster on a P4)
18 -- Updated the manual a bit
19 -- Ok so I haven't done the textbook work yet... My current freelance gig has landed me in France till the
20 end of Feb/05. Once I get back I'll have tons of free time and I plan to go to town on the book.
21 As of this release the API will freeze. At least until the book catches up with all the changes. I welcome
22 bug reports but new algorithms will have to wait.
23
24 December 23rd, 2004
25 v0.33 -- Fixed "small" variant for mp_div() which would munge with negative dividends...
26 -- Fixed bug in mp_prime_random_ex() which would set the most significant byte to zero when
27 no special flags were set
28 -- Fixed overflow [minor] bug in fast_s_mp_sqr()
29 -- Made the makefiles easier to configure the group/user that ltm will install as
30 -- Fixed "final carry" bug in comba multipliers. (Volkan Ceylan)
31 -- Matt Johnston pointed out a missing semi-colon in mp_exptmod
32
33 October 29th, 2004
34 v0.32 -- Added "makefile.shared" for shared object support
35 -- Added more to the build options/configs in the manual
36 -- Started the Depends framework, wrote dep.pl to scan deps and
37 produce "callgraph.txt" ;-)
38 -- Wrote SC_RSA_1 which will enable close to the minimum required to perform
39 RSA on 32-bit [or 64-bit] platforms with LibTomCrypt
40 -- Merged in the small/slower mp_div replacement. You can now toggle which
41 you want to use as your mp_div() at build time. Saves roughly 8KB or so.
42 -- Renamed a few files and changed some comments to make depends system work better.
43 (No changes to function names)
44 -- Merged in new Combas that perform 2 reads per inner loop instead of the older
45 3reads/2writes per inner loop of the old code. Really though if you want speed
46 learn to use TomsFastMath ;-)
47
48 August 9th, 2004
49 v0.31 -- "profiled" builds now :-) new timings for Intel Northwoods
50 -- Added "pretty" build target
51 -- Update mp_init() to actually assign 0's instead of relying on calloc()
52 -- "Wolfgang Ehrhardt" <[email protected]> found a bug in mp_mul() where if
53 you multiply a negative by zero you get negative zero as the result. Oops.
54 -- J Harper from PeerSec let me toy with his AMD64 and I got 60-bit digits working properly
55 [this also means that I fixed a bug where if sizeof(int) < sizeof(mp_digit) it would bug]
56
57 April 11th, 2004
58 v0.30 -- Added "mp_toradix_n" which stores upto "n-1" least significant digits of an mp_int
59 -- Johan Lindh sent a patch so MSVC wouldn't whine about redefining malloc [in weird dll modes]
60 -- Henrik Goldman spotted a missing OPT_CAST in mp_fwrite()
61 -- Tuned tommath.h so that when MP_LOW_MEM is defined MP_PREC shall be reduced.
62 [I also allow MP_PREC to be externally defined now]
63 -- Sped up mp_cnt_lsb() by using a 4x4 table [e.g. 4x speedup]
64 -- Added mp_prime_random_ex() which is a more versatile prime generator accurate to
65 exact bit lengths (unlike the deprecated but still available mp_prime_random() which
66 is only accurate to byte lengths). See the new LTM_PRIME_* flags ;-)
67 -- Alex Polushin contributed an optimized mp_sqrt() as well as mp_get_int() and mp_is_square().
68 I've cleaned them all up to be a little more consistent [along with one bug fix] for this release.
69 -- Added mp_init_set and mp_init_set_int to initialize and set small constants with one function
70 call.
71 -- Removed /etclib directory [um LibTomPoly deprecates this].
72 -- Fixed mp_mod() so the sign of the result agrees with the sign of the modulus.
73 ++ N.B. My semester is almost up so expect updates to the textbook to be posted to the libtomcrypt.org
74 website.
75
76 Jan 25th, 2004
77 v0.29 ++ Note: "Henrik" from the v0.28 changelog refers to Henrik Goldman ;-)
78 -- Added fix to mp_shrink to prevent a realloc when used == 0 [e.g. realloc zero bytes???]
79 -- Made the mp_prime_rabin_miller_trials() function internal table smaller and also
80 set the minimum number of tests to two (sounds a bit safer).
81 -- Added a mp_exteuclid() which computes the extended euclidean algorithm.
82 -- Fixed a memory leak in s_mp_exptmod() [called when Barrett reduction is to be used] which would arise
83 if a multiplication or subsequent reduction failed [would not free the temp result].
84 -- Made an API change to mp_radix_size(). It now returns an error code and stores the required size
85 through an "int star" passed to it.
86
87 Dec 24th, 2003
88 v0.28 -- Henrik Goldman suggested I add casts to the montomgery code [stores into mu...] so compilers wouldn't
89 spew [erroneous] diagnostics... fixed.
90 -- Henrik Goldman also spotted two typos. One in mp_radix_size() and another in mp_toradix().
91 -- Added fix to mp_shrink() to avoid a memory leak.
92 -- Added mp_prime_random() which requires a callback to make truly random primes of a given nature
93 (idea from chat with Niels Ferguson at Crypto'03)
94 -- Picked up a second wind. I'm filled with Gooo. Mission Gooo!
95 -- Removed divisions from mp_reduce_is_2k()
96 -- Sped up mp_div_d() [general case] to use only one division per digit instead of two.
97 -- Added the heap macros from LTC to LTM. Now you can easily [by editing four lines of tommath.h]
98 change the name of the heap functions used in LTM [also compatible with LTC via MPI mode]
99 -- Added bn_prime_rabin_miller_trials() which gives the number of Rabin-Miller trials to achieve
100 a failure rate of less than 2^-96
101 -- fixed bug in fast_mp_invmod(). The initial testing logic was wrong. An invalid input is not when
102 "a" and "b" are even it's when "b" is even [the algo is for odd moduli only].
103 -- Started a new manual [finally]. It is incomplete and will be finished as time goes on. I had to stop
104 adding full demos around half way in chapter three so I could at least get a good portion of the
105 manual done. If you really need help using the library you can always email me!
106 -- My Textbook is now included as part of the package [all Public Domain]
107
108 Sept 19th, 2003
109 v0.27 -- Removed changes.txt~ which was made by accident since "kate" decided it was
110 a good time to re-enable backups... [kde is fun!]
111 -- In mp_grow() "a->dp" is not overwritten by realloc call [re: memory leak]
112 Now if mp_grow() fails the mp_int is still valid and can be cleared via
113 mp_clear() to reclaim the memory.
114 -- Henrik Goldman found a buffer overflow bug in mp_add_d(). Fixed.
115 -- Cleaned up mp_mul_d() to be much easier to read and follow.
116
117 Aug 29th, 2003
118 v0.26 -- Fixed typo that caused warning with GCC 3.2
119 -- Martin Marcel noticed a bug in mp_neg() that allowed negative zeroes.
120 Also, Martin is the fellow who noted the bugs in mp_gcd() of 0.24/0.25.
121 -- Martin Marcel noticed an optimization [and slight bug] in mp_lcm().
122 -- Added fix to mp_read_unsigned_bin to prevent a buffer overflow.
123 -- Beefed up the comments in the baseline multipliers [and montgomery]
124 -- Added "mont" demo to the makefile.msvc in etc/
125 -- Optimized sign compares in mp_cmp from 4 to 2 cases.
126
127 Aug 4th, 2003
128 v0.25 -- Fix to mp_gcd again... oops (0,-a) == (-a, 0) == a
129 -- Fix to mp_clear which didn't reset the sign [Greg Rose]
130 -- Added mp_error_to_string() to convert return codes to strings. [Greg Rose]
131 -- Optimized fast_mp_invmod() to do the test for invalid inputs [both even]
132 first so temps don't have to be initialized if it's going to fail.
133 -- Optimized mp_gcd() by removing mp_div_2d calls for when one of the inputs
134 is odd.
135 -- Tons of new comments, some indentation fixups, etc.
136 -- mp_jacobi() returns MP_VAL if the modulus is less than or equal to zero.
137 -- fixed two typos in the header of each file :-)
138 -- LibTomMath is officially Public Domain [see LICENSE]
139
140 July 15th, 2003
141 v0.24 -- Optimized mp_add_d and mp_sub_d to not allocate temporary variables
142 -- Fixed mp_gcd() so the gcd of 0,0 is 0. Allows the gcd operation to be chained
143 e.g. (0,0,a) == a [instead of 1]
144 -- Should be one of the last release for a while. Working on LibTomMath book now.
145 -- optimized the pprime demo [/etc/pprime.c] to first make a huge table of single
146 digit primes then it reads them randomly instead of randomly choosing/testing single
147 digit primes.
148
149 July 12th, 2003
150 v0.23 -- Optimized mp_prime_next_prime() to not use mp_mod [via is_divisible()] in each
151 iteration. Instead now a smaller table is kept of the residues which can be updated
152 without division.
153 -- Fixed a bug in next_prime() where an input of zero would be treated as odd and
154 have two added to it [to move to the next odd].
155 -- fixed a bug in prime_fermat() and prime_miller_rabin() which allowed the base
156 to be negative, zero or one. Normally the test is only valid if the base is
157 greater than one.
158 -- changed the next_prime() prototype to accept a new parameter "bbs_style" which
159 will find the next prime congruent to 3 mod 4. The default [bbs_style==0] will
160 make primes which are either congruent to 1 or 3 mod 4.
161 -- fixed mp_read_unsigned_bin() so that it doesn't include both code for
162 the case DIGIT_BIT < 8 and >= 8
163 -- optimized div_d() to easy out on division by 1 [or if a == 0] and use
164 logical shifts if the divisor is a power of two.
165 -- the default DIGIT_BIT type was not int for non-default builds. Fixed.
166
167 July 2nd, 2003
168 v0.22 -- Fixed up mp_invmod so the result is properly in range now [was always congruent to the inverse...]
169 -- Fixed up s_mp_exptmod and mp_exptmod_fast so the lower half of the pre-computed table isn't allocated
170 which makes the algorithm use half as much ram.
171 -- Fixed the install script not to make the book :-) [which isn't included anyways]
172 -- added mp_cnt_lsb() which counts how many of the lsbs are zero
173 -- optimized mp_gcd() to use the new mp_cnt_lsb() to replace multiple divisions by two by a single division.
174 -- applied similar optimization to mp_prime_miller_rabin().
175 -- Fixed a bug in both mp_invmod() and fast_mp_invmod() which tested for odd
176 via "mp_iseven() == 0" which is not valid [since zero is not even either].
177
178 June 19th, 2003
179 v0.21 -- Fixed bug in mp_mul_d which would not handle sign correctly [would not always forward it]
180 -- Removed the #line lines from gen.pl [was in violation of ISO C]
181
182 June 8th, 2003
183 v0.20 -- Removed the book from the package. Added the TDCAL license document.
184 -- This release is officially pure-bred TDCAL again [last officially TDCAL based release was v0.16]
185
186 June 6th, 2003
187 v0.19 -- Fixed a bug in mp_montgomery_reduce() which was introduced when I tweaked mp_rshd() in the previous release.
188 Essentially the digits were not trimmed before the compare which cause a subtraction to occur all the time.
189 -- Fixed up etc/tune.c a bit to stop testing new cutoffs after 16 failures [to find more optimal points].
190 Brute force ho!
191
192
193 May 29th, 2003
194 v0.18 -- Fixed a bug in s_mp_sqr which would handle carries properly just not very elegantly.
195 (e.g. correct result, just bad looking code)
196 -- Fixed bug in mp_sqr which still had a 512 constant instead of MP_WARRAY
197 -- Added Toom-Cook multipliers [needs tuning!]
198 -- Added efficient divide by 3 algorithm mp_div_3
199 -- Re-wrote mp_div_d to be faster than calling mp_div
200 -- Added in a donated BCC makefile and a single page LTM poster ([email protected])
201 -- Added mp_reduce_2k which reduces an input modulo n = 2**p - k for any single digit k
202 -- Made the exptmod system be aware of the 2k reduction algorithms.
203 -- Rewrote mp_dr_reduce to be smaller, simpler and easier to understand.
204
205 May 17th, 2003
206 v0.17 -- Benjamin Goldberg submitted optimized mp_add and mp_sub routines. A new gen.pl as well
207 as several smaller suggestions. Thanks!
208 -- removed call to mp_cmp in inner loop of mp_div and put mp_cmp_mag in its place :-)
209 -- Fixed bug in mp_exptmod that would cause it to fail for odd moduli when DIGIT_BIT != 28
210 -- mp_exptmod now also returns errors if the modulus is negative and will handle negative exponents
211 -- mp_prime_is_prime will now return true if the input is one of the primes in the prime table
212 -- Damian M Gryski ([email protected]) found a index out of bounds error in the
213 mp_fast_s_mp_mul_high_digs function which didn't come up before. (fixed)
214 -- Refactored the DR reduction code so there is only one function per file.
215 -- Fixed bug in the mp_mul() which would erroneously avoid the faster multiplier [comba] when it was
216 allowed. The bug would not cause the incorrect value to be produced just less efficient (fixed)
217 -- Fixed similar bug in the Montgomery reduction code.
218 -- Added tons of (mp_digit) casts so the 7/15/28/31 bit digit code will work flawlessly out of the box.
219 Also added limited support for 64-bit machines with a 60-bit digit. Both thanks to Tom Wu ([email protected])
220 -- Added new comments here and there, cleaned up some code [style stuff]
221 -- Fixed a lingering typo in mp_exptmod* that would set bitcnt to zero then one. Very silly stuff :-)
222 -- Fixed up mp_exptmod_fast so it would set "redux" to the comba Montgomery reduction if allowed. This
223 saves quite a few calls and if statements.
224 -- Added etc/mont.c a test of the Montgomery reduction [assuming all else works :-| ]
225 -- Fixed up etc/tune.c to use a wider test range [more appropriate] also added a x86 based addition which
226 uses RDTSC for high precision timing.
227 -- Updated demo/demo.c to remove MPI stuff [won't work anyways], made the tests run for 2 seconds each so its
228 not so insanely slow. Also made the output space delimited [and fixed up various errors]
229 -- Added logs directory, logs/graph.dem which will use gnuplot to make a series of PNG files
230 that go with the pre-made index.html. You have to build [via make timing] and run ltmtest first in the
231 root of the package.
232 -- Fixed a bug in mp_sub and mp_add where "-a - -a" or "-a + a" would produce -0 as the result [obviously invalid].
233 -- Fixed a bug in mp_rshd. If the count == a.used it should zero/return [instead of shifting]
234 -- Fixed a "off-by-one" bug in mp_mul2d. The initial size check on alloc would be off by one if the residue
235 shifting caused a carry.
236 -- Fixed a bug where s_mp_mul_digs() would not call the Comba based routine if allowed. This made Barrett reduction
237 slower than it had to be.
238
239 Mar 29th, 2003
240 v0.16 -- Sped up mp_div by making normalization one shift call
241 -- Sped up mp_mul_2d/mp_div_2d by aliasing pointers :-)
242 -- Cleaned up mp_gcd to use the macros for odd/even detection
243 -- Added comments here and there, mostly there but occasionally here too.
244
245 Mar 22nd, 2003
246 v0.15 -- Added series of prime testing routines to lib
247 -- Fixed up etc/tune.c
248 -- Added DR reduction algorithm
249 -- Beefed up the manual more.
250 -- Fixed up demo/demo.c so it doesn't have so many warnings and it does the full series of
251 tests
252 -- Added "pre-gen" directory which will hold a "gen.pl"'ed copy of the entire lib [done at
253 zipup time so its always the latest]
254 -- Added conditional casts for C++ users [boo!]
255
256 Mar 15th, 2003
257 v0.14 -- Tons of manual updates
258 -- cleaned up the directory
259 -- added MSVC makefiles
260 -- source changes [that I don't recall]
261 -- Fixed up the lshd/rshd code to use pointer aliasing
262 -- Fixed up the mul_2d and div_2d to not call rshd/lshd unless needed
263 -- Fixed up etc/tune.c a tad
264 -- fixed up demo/demo.c to output comma-delimited results of timing
265 also fixed up timing demo to use a finer granularity for various functions
266 -- fixed up demo/demo.c testing to pause during testing so my Duron won't catch on fire
267 [stays around 31-35C during testing :-)]
268
269 Feb 13th, 2003
270 v0.13 -- tons of minor speed-ups in low level add, sub, mul_2 and div_2 which propagate
271 to other functions like mp_invmod, mp_div, etc...
272 -- Sped up mp_exptmod_fast by using new code to find R mod m [e.g. B^n mod m]
273 -- minor fixes
274
275 Jan 17th, 2003
276 v0.12 -- re-wrote the majority of the makefile so its more portable and will
277 install via "make install" on most *nix platforms
278 -- Re-packaged all the source as seperate files. Means the library a single
279 file packagage any more. Instead of just adding "bn.c" you have to add
280 libtommath.a
281 -- Renamed "bn.h" to "tommath.h"
282 -- Changes to the manual to reflect all of this
283 -- Used GNU Indent to clean up the source
284
285 Jan 15th, 2003
286 v0.11 -- More subtle fixes
287 -- Moved to gentoo linux [hurrah!] so made *nix specific fixes to the make process
288 -- Sped up the montgomery reduction code quite a bit
289 -- fixed up demo so when building timing for the x86 it assumes ELF format now
290
291 Jan 9th, 2003
292 v0.10 -- Pekka Riikonen suggested fixes to the radix conversion code.
293 -- Added baseline montgomery and comba montgomery reductions, sped up exptmods
294 [to a point, see bn.h for MONTGOMERY_EXPT_CUTOFF]
295
296 Jan 6th, 2003
297 v0.09 -- Updated the manual to reflect recent changes. :-)
298 -- Added Jacobi function (mp_jacobi) to supplement the number theory side of the lib
299 -- Added a Mersenne prime finder demo in ./etc/mersenne.c
300
301 Jan 2nd, 2003
302 v0.08 -- Sped up the multipliers by moving the inner loop variables into a smaller scope
303 -- Corrected a bunch of small "warnings"
304 -- Added more comments
305 -- Made "mtest" be able to use /dev/random, /dev/urandom or stdin for RNG data
306 -- Corrected some bugs where error messages were potentially ignored
307 -- add etc/pprime.c program which makes numbers which are provably prime.
308
309 Jan 1st, 2003
310 v0.07 -- Removed alot of heap operations from core functions to speed them up
311 -- Added a root finding function [and mp_sqrt macro like from MPI]
312 -- Added more to manual
313
314 Dec 31st, 2002
315 v0.06 -- Sped up the s_mp_add, s_mp_sub which inturn sped up mp_invmod, mp_exptmod, etc...
316 -- Cleaned up the header a bit more
317
318 Dec 30th, 2002
319 v0.05 -- Builds with MSVC out of the box
320 -- Fixed a bug in mp_invmod w.r.t. even moduli
321 -- Made mp_toradix and mp_read_radix use char instead of unsigned char arrays
322 -- Fixed up exptmod to use fewer multiplications
323 -- Fixed up mp_init_size to use only one heap operation
324 -- Note there is a slight "off-by-one" bug in the library somewhere
325 without the padding (see the source for comment) the library
326 crashes in libtomcrypt. Anyways a reasonable workaround is to pad the
327 numbers which will always correct it since as the numbers grow the padding
328 will still be beyond the end of the number
329 -- Added more to the manual
330
331 Dec 29th, 2002
332 v0.04 -- Fixed a memory leak in mp_to_unsigned_bin
333 -- optimized invmod code
334 -- Fixed bug in mp_div
335 -- use exchange instead of copy for results
336 -- added a bit more to the manual
337
338 Dec 27th, 2002
339 v0.03 -- Sped up s_mp_mul_high_digs by not computing the carries of the lower digits
340 -- Fixed a bug where mp_set_int wouldn't zero the value first and set the used member.
341 -- fixed a bug in s_mp_mul_high_digs where the limit placed on the result digits was not calculated properly
342 -- fixed bugs in add/sub/mul/sqr_mod functions where if the modulus and dest were the same it wouldn't work
343 -- fixed a bug in mp_mod and mp_mod_d concerning negative inputs
344 -- mp_mul_d didn't preserve sign
345 -- Many many many many fixes
346 -- Works in LibTomCrypt now :-)
347 -- Added iterations to the timing demos... more accurate.
348 -- Tom needs a job.
349
350 Dec 26th, 2002
351 v0.02 -- Fixed a few "slips" in the manual. This is "LibTomMath" afterall :-)
352 -- Added mp_cmp_mag, mp_neg, mp_abs and mp_radix_size that were missing.
353 -- Sped up the fast [comba] multipliers more [yahoo!]
354
355 Dec 25th,2002
356 v0.01 -- Initial release. Gimme a break.
357 -- Todo list,
358 add details to manual [e.g. algorithms]
359 more comments in code
360 example programs