[ LibTomCrypt ] [ LibTomMath ]
[ LibTomPoly ] [ LibTomNet ]
[ LibTomFloat ] [ TomsFastMath ]
[ LTC Book ]
[ News ] [ Features ] [ Changes ] [ Download ]
[ Mirror1 ] [ Mirror2 ]
Changes
- January 26th, 2006 Release of LibTomMath v0.38
- Fix off by one in the multipliers (non-fatal)
- November 18th, 2005 Release of LibTomMath v0.37
- Fix to mp_add_d() to avoid getting a "-0" result
- Fix to makefile.bcc
- Fix to mp_toradix_n()
- Updated makefiles
- August 1st, 2005 Release of LibTomMath v0.36
- Source code cleanups (stuff I did for the Tcl folk)
- Few typos in the textbook fixed
- Updated makefiles
- March 12th, 2005 Release of LibTomMath v0.35
- Fixed various overflows/underruns
- Fixed bug in invmod with negative inputs
- Fixed bug in mp_rand() outputing the wrong number of digits
- Fixed bug in mp_radix_size
- February 12th, 2005 Release of LibTomMath v0.34
- Fixed a few overruns and range errosr in the combas
- Cleaned up the mp_prime_random_ex() function
- Added buffer-friendly signed/unsigned transforms
- Added "mp_reduce_2k_l" to reduce modulo 2^p - b for b > MP_MASK
- December 23rd, 2004 Release of LibTomMath v0.33
- Fixed a few overruns in the comba multipliers
- Fixed bug in the prime generator code (the MS byte is now not zero'ed)
- Several code cleanups.
- October 29th, 2004 Release of LibTomMath v0.32
- Added shared object support to build
- Added more build options to the documentation
- Produced a depends framework to better manipulate the library
- Wrote first setup SC_RSA_1 useful for RSA crypto in LTC
- Renamed a few files
- Merged in new divide and comba routines
- Aug 9th, 2004 Release of LibTomMath v0.31
- Fixed bugs in mp_2expt and mp_reduce_is_2k() so the lib will now work with 60-bit digits
- Fixed minor "not-so-portablisms" for completeness
- Fixed sign bug in mp_div and mp_mul when dealing with zero quantities...
- It's hot in here.
- Apr 11th, 2004 Release of LibTomMath v0.30
- Added a few new helper functions
- Added tons to the documentation
- Finally wrote a flexible random prime generator
- Fixed a few bugs.
- Jan 25th, 2004 Release of LibTomMath v0.29
- Fixed more bugs.
- Added Extended Euclidean Algorithm.
- Dec 24th, 2003 Release of LibTomMath v0.28
- Fixed more bugs.
- Started a new user manual
- Added my textbook under Public Domain to the project.
- Sept 19th, 2003 Release of LibTomMath v0.27
- Henrik Goldman found a buffer-overflow in mp_add_d() which I fixed.
- I cleaned up mp_mul_d()
- Fixed a memory-leak in mp_grow()
- Dan is a nice guy.
- August 29th, 2003 Release of LibTomMath v0.26
- Small typo that caused problems with GCC 3.2
- Martin Marcel pointed out bugs in the mp_neg and mp_lcm functions
- Fixed bug in mp_read_unsigned_bin
- Added more comments to baseline algos
- Optimized mp_cmp
- Added "mont" demo to MSVC makefile
- August 4th, 2003. Release of LibTomMath v0.25
- Package is now released under a Public Domain license.
- Small fixes to mp_gcd()
- Addition of error_to_string() for verbose error messages
- new comments, indentation fixups
- Added error test for mp_jacobi() to catch invalid inputs
- July 16th, 2003. Release of LibTomMath v0.24
- Optimized mp_add_d and mp_sub_d
- fix to mp_gcd.
- July 12th, 2003. Release of LibTomMath v0.23
- Updates, fixes and optimizations to the prime testing code
- Optimization to mp_div_d()
- Few others changes I can't remember. See the change log.
- July 2nd, 2003. Release of LibTomMath v0.22.
- Fixed a bug in both variants of mp_invmod() which would return an erroneous result with prob around 1/20000
- Added mp_cnt_lsb() which counts the number of zero lsb bits.
- Optimized mp_gcd() and mp_prime_miller_rabin().
- June 19th, 2003. Release of LibTomMath v0.21.
- Fixed a bug in mp_mul_d which would not forward the sign correctly.
- Fixed a bug in gen.pl which would emit #line tags in violation of ISO C
- June 8th, 2003. Release of LibTomMath v0.20.
- Officially all TDCAL now [book removed].
- No changes to the code itself.
- June 6th, 2003. Release of LibTomMath v0.19.
- Fixed a bug in mp_montgomery_reduce().
- Spruced up etc/tune.c
- Removed demos/test.c which was empty.
- Fixed typo in BCC makefile
- May 29th, 2003. Release of LibTomMath v0.18.
- Added Toom Multiplication
- Sped up DR reduction (mp_dr_reduce)
- Added a new DR like reduction algo for moduli of the form 2p - k
- Fixed a slight bug in the Comba squaring algorithm
- Optimized mp_div_d and added mp_div_3 for fast division by three.
- Added a new single page poster [poster.pdf]
- May 17th, 2003. Release of LibTomMath v0.17.
- Tons of bug fixes (see changes.txt) Most notably performance bugs fixed.
- First half of the LTM book drafted. Type "make docs" to make your very own copy.
- Small optimizations here and there.
- March 29th, 2003. Release of LibTomMath v0.16.
- Tons of new comments
- Fix a bug in mp_div that was hard to spot
- sped up the div_2d/mul_2d routines
- March 22nd, 2003. Release of LibTomMath v0.15.
- Quite a few documentation additions
- Addition of primality testing routines (Fermat, Miller-Rabin, etc...)
- Addition of Dimminished Radix (DR) reduction algorithms [very fast!]
- Fixed up etc/tune.c and demo/demo.c [cleaned out warnings and such]
- March 15th, 2003. Initial re-opening release of v0.14.