Skip to content

Commit

Permalink
added libtommath-0.20
Browse files Browse the repository at this point in the history
  • Loading branch information
Tom St Denis authored and sjaeckel committed Jul 15, 2010
1 parent ef490f3 commit 0fe7a2d
Show file tree
Hide file tree
Showing 18 changed files with 10 additions and 12,990 deletions.
Binary file modified bn.pdf
Binary file not shown.
2 changes: 1 addition & 1 deletion bn.tex
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
\documentclass[]{article}
\begin{document}

\title{LibTomMath v0.19 \\ A Free Multiple Precision Integer Library \\ http://math.libtomcrypt.org }
\title{LibTomMath v0.20 \\ A Free Multiple Precision Integer Library \\ http://math.libtomcrypt.org }
\author{Tom St Denis \\ tomstdenis@iahu.ca}
\maketitle
\newpage
Expand Down
1 change: 0 additions & 1 deletion bn_mp_exptmod_fast.c
Original file line number Diff line number Diff line change
Expand Up @@ -80,7 +80,6 @@ mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode)
if (((P->used * 2 + 1) < MP_WARRAY) &&
P->used < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
redux = fast_mp_montgomery_reduce;

} else {
/* use slower baselien method */
redux = mp_montgomery_reduce;
Expand Down
4 changes: 4 additions & 0 deletions changes.txt
Original file line number Diff line number Diff line change
@@ -1,3 +1,7 @@
June 8th, 2003
v0.20 -- Removed the book from the package. Added the TDCAL license document.
-- This release is officially pure-bred TDCAL again [last officially TDCAL based release was v0.16]

June 6th, 2003
v0.19 -- Fixed a bug in mp_montgomery_reduce() which was introduced when I tweaked mp_rshd() in the previous release.
Essentially the digits were not trimmed before the compare which cause a subtraction to occur all the time.
Expand Down
3 changes: 1 addition & 2 deletions etc/2kprime.1
Original file line number Diff line number Diff line change
@@ -1,2 +1 @@
256-bits (k = 36113) = 115792089237316195423570985008687907853269984665640564039457584007913129603823
512-bits (k = 38117) = 13407807929942597099574024998205846127479365820592393377723561443721764030073546976801874298166903427690031858186486050853753882811946569946433649006045979
259-bits (k = 17745) = 926336713898529563388567880069503262826159877325124512315660672063305037101743
2 changes: 1 addition & 1 deletion etc/2kprime.c
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ int sizes[] = {256, 512, 768, 1024, 1536, 2048, 3072, 4096};
int main(void)
{
char buf[2000];
int x, y, t;
int x, y;
mp_int q, p;
FILE *out;
clock_t t1;
Expand Down
5 changes: 3 additions & 2 deletions makefile
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
CFLAGS += -I./ -Wall -W -Wshadow -O3 -fomit-frame-pointer -funroll-loops

VERSION=0.19
VERSION=0.20

default: libtommath.a

Expand Down Expand Up @@ -103,5 +103,6 @@ clean:
zipup: clean manual poster
perl gen.pl ; mv mpi.c pre_gen/ ; \
cd .. ; rm -rf ltm* libtommath-$(VERSION) ; mkdir libtommath-$(VERSION) ; \
cp -R ./libtommath/* ./libtommath-$(VERSION)/ ; tar -c libtommath-$(VERSION)/* > ltm-$(VERSION).tar ; \
cp -R ./libtommath/* ./libtommath-$(VERSION)/ ; cp tdcal.pdf ./libtommath-$(VERSION)/ ; cd ./libtommath-$(VERSION) ; rm -f tommath.src tommath.tex tommath.out ; cd pics ; rm -f * ; cd .. ; cd .. ; ls ; \
tar -c libtommath-$(VERSION)/* > ltm-$(VERSION).tar ; \
bzip2 -9vv ltm-$(VERSION).tar ; zip -9 -r ltm-$(VERSION).zip libtommath-$(VERSION)/*
Binary file removed pics/expt_state.sxd
Binary file not shown.
Binary file removed pics/expt_state.tif
Binary file not shown.
23 changes: 0 additions & 23 deletions pics/makefile

This file was deleted.

Binary file removed pics/sliding_window.TIF
Binary file not shown.
Binary file removed pics/sliding_window.sxd
Binary file not shown.
Binary file modified poster.pdf
Binary file not shown.
1 change: 0 additions & 1 deletion pre_gen/mpi.c
Original file line number Diff line number Diff line change
Expand Up @@ -2155,7 +2155,6 @@ mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode)
if (((P->used * 2 + 1) < MP_WARRAY) &&
P->used < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
redux = fast_mp_montgomery_reduce;

} else {
/* use slower baselien method */
redux = mp_montgomery_reduce;
Expand Down
Binary file added tdcal.pdf
Binary file not shown.
143 changes: 0 additions & 143 deletions tommath.out

This file was deleted.

Loading

0 comments on commit 0fe7a2d

Please sign in to comment.