TeaSpeak/tommath
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

trim trailing spaces

Browse Source
This commit is contained in:
Steffen Jaeckel 2014-02-14 11:30:15 +01:00
parent a4b20be8a2
commit ddd788a185
2 changed files with 13 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
demo/demo.c
View File

@ -69,7 +69,7 @@ int main(void)
srand(time(NULL)); srand(time(NULL));
#if 0 #if 0
// test montgomery // test montgomery
printf("Testing montgomery...\n"); printf("Testing montgomery...\n");
for (i = 1; i < 10; i++) { for (i = 1; i < 10; i++) {
printf("Testing digit size: %d\n", i); printf("Testing digit size: %d\n", i);
@ -81,7 +81,7 @@ int main(void)
mp_montgomery_calc_normalization(&b, &a); mp_montgomery_calc_normalization(&b, &a);
mp_montgomery_setup(&a, &mp); mp_montgomery_setup(&a, &mp);
// now test a random reduction // now test a random reduction
for (ix = 0; ix < 100; ix++) { for (ix = 0; ix < 100; ix++) {
mp_rand(&c, 1 + abs(rand()) % (2*i)); mp_rand(&c, 1 + abs(rand()) % (2*i));
mp_copy(&c, &d); mp_copy(&c, &d);
@ -91,7 +91,7 @@ int main(void)
mp_montgomery_reduce(&c, &a, mp); mp_montgomery_reduce(&c, &a, mp);
mp_mulmod(&c, &b, &a, &c); mp_mulmod(&c, &b, &a, &c);
if (mp_cmp(&c, &d) != MP_EQ) { if (mp_cmp(&c, &d) != MP_EQ) {
printf("d = e mod a, c = e MOD a\n"); printf("d = e mod a, c = e MOD a\n");
mp_todecimal(&a, buf); printf("a = %s\n", buf); mp_todecimal(&a, buf); printf("a = %s\n", buf);
mp_todecimal(&e, buf); printf("e = %s\n", buf); mp_todecimal(&e, buf); printf("e = %s\n", buf);

20
tommath.h
View File

@ -46,7 +46,7 @@ extern "C" {
/* detect 64-bit mode if possible */ /* detect 64-bit mode if possible */
#if defined(__x86_64__) #if defined(__x86_64__)
#if !(defined(MP_64BIT) && defined(MP_16BIT) && defined(MP_8BIT)) #if !(defined(MP_64BIT) && defined(MP_16BIT) && defined(MP_8BIT))
#define MP_64BIT #define MP_64BIT
#endif #endif
@ -79,10 +79,10 @@ extern "C" {
#define DIGIT_BIT 60 #define DIGIT_BIT 60
#else #else
/* this is the default case, 28-bit digits */ /* this is the default case, 28-bit digits */
/* this is to make porting into LibTomCrypt easier :-) */ /* this is to make porting into LibTomCrypt easier :-) */
#ifndef CRYPT #ifndef CRYPT
#if defined(_MSC_VER) || defined(__BORLANDC__) #if defined(_MSC_VER) || defined(__BORLANDC__)
typedef unsigned __int64 ulong64; typedef unsigned __int64 ulong64;
typedef signed __int64 long64; typedef signed __int64 long64;
#else #else
@ -94,20 +94,20 @@ extern "C" {
typedef unsigned long mp_digit; typedef unsigned long mp_digit;
typedef ulong64 mp_word; typedef ulong64 mp_word;
#ifdef MP_31BIT #ifdef MP_31BIT
/* this is an extension that uses 31-bit digits */ /* this is an extension that uses 31-bit digits */
#define DIGIT_BIT 31 #define DIGIT_BIT 31
#else #else
/* default case is 28-bit digits, defines MP_28BIT as a handy macro to test */ /* default case is 28-bit digits, defines MP_28BIT as a handy macro to test */
#define DIGIT_BIT 28 #define DIGIT_BIT 28
#define MP_28BIT #define MP_28BIT
#endif #endif
#endif #endif
/* define heap macros */ /* define heap macros */
#ifndef CRYPT #ifndef CRYPT
/* default to libc stuff */ /* default to libc stuff */
#ifndef XMALLOC #ifndef XMALLOC
#define XMALLOC malloc #define XMALLOC malloc
#define XFREE free #define XFREE free
#define XREALLOC realloc #define XREALLOC realloc
@ -169,7 +169,7 @@ extern int KARATSUBA_MUL_CUTOFF,
#define MP_PREC 32 /* default digits of precision */ #define MP_PREC 32 /* default digits of precision */
#else #else
#define MP_PREC 8 /* default digits of precision */ #define MP_PREC 8 /* default digits of precision */
#endif #endif
#endif #endif
/* size of comba arrays, should be at least 2 * 2**(BITS_PER_WORD - BITS_PER_DIGIT*2) */ /* size of comba arrays, should be at least 2 * 2**(BITS_PER_WORD - BITS_PER_DIGIT*2) */
@ -476,7 +476,7 @@ int mp_prime_fermat(mp_int *a, mp_int *b, int *result);
int mp_prime_miller_rabin(mp_int *a, mp_int *b, int *result); int mp_prime_miller_rabin(mp_int *a, mp_int *b, int *result);
/* This gives [for a given bit size] the number of trials required /* This gives [for a given bit size] the number of trials required
* such that Miller-Rabin gives a prob of failure lower than 2^-96 * such that Miller-Rabin gives a prob of failure lower than 2^-96
*/ */
int mp_prime_rabin_miller_trials(int size); int mp_prime_rabin_miller_trials(int size);
@ -497,7 +497,7 @@ int mp_prime_is_prime(mp_int *a, int t, int *result);
int mp_prime_next_prime(mp_int *a, int t, int bbs_style); int mp_prime_next_prime(mp_int *a, int t, int bbs_style);
/* makes a truly random prime of a given size (bytes), /* makes a truly random prime of a given size (bytes),
* call with bbs = 1 if you want it to be congruent to 3 mod 4 * call with bbs = 1 if you want it to be congruent to 3 mod 4
* *
* You have to supply a callback which fills in a buffer with random bytes. "dat" is a parameter you can * You have to supply a callback which fills in a buffer with random bytes. "dat" is a parameter you can
* have passed to the callback (e.g. a state or something). This function doesn't use "dat" itself * have passed to the callback (e.g. a state or something). This function doesn't use "dat" itself
@ -510,7 +510,7 @@ int mp_prime_next_prime(mp_int *a, int t, int bbs_style);
/* makes a truly random prime of a given size (bits), /* makes a truly random prime of a given size (bits),
* *
* Flags are as follows: * Flags are as follows:
* *
* LTM_PRIME_BBS - make prime congruent to 3 mod 4 * LTM_PRIME_BBS - make prime congruent to 3 mod 4
* LTM_PRIME_SAFE - make sure (p-1)/2 is prime as well (implies LTM_PRIME_BBS) * LTM_PRIME_SAFE - make sure (p-1)/2 is prime as well (implies LTM_PRIME_BBS)
* LTM_PRIME_2MSB_ON - make the 2nd highest bit one * LTM_PRIME_2MSB_ON - make the 2nd highest bit one