77 lines
3.6 KiB
Plaintext
77 lines
3.6 KiB
Plaintext
Jan 15th, 2003
|
|
v0.11 -- More subtle fixes
|
|
-- Moved to gentoo linux [hurrah!] so made *nix specific fixes to the make process
|
|
-- Sped up the montgomery reduction code quite a bit
|
|
-- fixed up demo so when building timing for the x86 it assumes ELF format now
|
|
|
|
Jan 9th, 2003
|
|
v0.10 -- Pekka Riikonen suggested fixes to the radix conversion code.
|
|
-- Added baseline montgomery and comba montgomery reductions, sped up exptmods
|
|
[to a point, see bn.h for MONTGOMERY_EXPT_CUTOFF]
|
|
|
|
Jan 6th, 2003
|
|
v0.09 -- Updated the manual to reflect recent changes. :-)
|
|
-- Added Jacobi function (mp_jacobi) to supplement the number theory side of the lib
|
|
-- Added a Mersenne prime finder demo in ./etc/mersenne.c
|
|
|
|
Jan 2nd, 2003
|
|
v0.08 -- Sped up the multipliers by moving the inner loop variables into a smaller scope
|
|
-- Corrected a bunch of small "warnings"
|
|
-- Added more comments
|
|
-- Made "mtest" be able to use /dev/random, /dev/urandom or stdin for RNG data
|
|
-- Corrected some bugs where error messages were potentially ignored
|
|
-- add etc/pprime.c program which makes numbers which are provably prime.
|
|
|
|
Jan 1st, 2003
|
|
v0.07 -- Removed alot of heap operations from core functions to speed them up
|
|
-- Added a root finding function [and mp_sqrt macro like from MPI]
|
|
-- Added more to manual
|
|
|
|
Dec 31st, 2002
|
|
v0.06 -- Sped up the s_mp_add, s_mp_sub which inturn sped up mp_invmod, mp_exptmod, etc...
|
|
-- Cleaned up the header a bit more
|
|
|
|
Dec 30th, 2002
|
|
v0.05 -- Builds with MSVC out of the box
|
|
-- Fixed a bug in mp_invmod w.r.t. even moduli
|
|
-- Made mp_toradix and mp_read_radix use char instead of unsigned char arrays
|
|
-- Fixed up exptmod to use fewer multiplications
|
|
-- Fixed up mp_init_size to use only one heap operation
|
|
-- Note there is a slight "off-by-one" bug in the library somewhere
|
|
without the padding (see the source for comment) the library
|
|
crashes in libtomcrypt. Anyways a reasonable workaround is to pad the
|
|
numbers which will always correct it since as the numbers grow the padding
|
|
will still be beyond the end of the number
|
|
-- Added more to the manual
|
|
|
|
Dec 29th, 2002
|
|
v0.04 -- Fixed a memory leak in mp_to_unsigned_bin
|
|
-- optimized invmod code
|
|
-- Fixed bug in mp_div
|
|
-- use exchange instead of copy for results
|
|
-- added a bit more to the manual
|
|
|
|
Dec 27th, 2002
|
|
v0.03 -- Sped up s_mp_mul_high_digs by not computing the carries of the lower digits
|
|
-- Fixed a bug where mp_set_int wouldn't zero the value first and set the used member.
|
|
-- fixed a bug in s_mp_mul_high_digs where the limit placed on the result digits was not calculated properly
|
|
-- fixed bugs in add/sub/mul/sqr_mod functions where if the modulus and dest were the same it wouldn't work
|
|
-- fixed a bug in mp_mod and mp_mod_d concerning negative inputs
|
|
-- mp_mul_d didn't preserve sign
|
|
-- Many many many many fixes
|
|
-- Works in LibTomCrypt now :-)
|
|
-- Added iterations to the timing demos... more accurate.
|
|
-- Tom needs a job.
|
|
|
|
Dec 26th, 2002
|
|
v0.02 -- Fixed a few "slips" in the manual. This is "LibTomMath" afterall :-)
|
|
-- Added mp_cmp_mag, mp_neg, mp_abs and mp_radix_size that were missing.
|
|
-- Sped up the fast [comba] multipliers more [yahoo!]
|
|
|
|
Dec 25th,2002
|
|
v0.01 -- Initial release. Gimme a break.
|
|
-- Todo list,
|
|
add details to manual [e.g. algorithms]
|
|
more comments in code
|
|
example programs
|