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

demo: test one big montgomery reduction

Browse Source 
...only for coverage reasons...
This commit is contained in:
Steffen Jaeckel 2015-04-26 16:58:36 +02:00
parent 0d816a1a2e
commit 25480d57b7
1 changed files with 9 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
demo/demo.c
View File

@ -187,7 +187,9 @@ int main(void)
// test montgomery // test montgomery
printf("Testing: montgomery...\n"); printf("Testing: montgomery...\n");
for (i = 1; i < 10; i++) { for (i = 1; i <= 10; i++) {
if (i == 10)
i = 1000;
printf(" digit size: %2d\r", i); printf(" digit size: %2d\r", i);
fflush(stdout); fflush(stdout);
for (n = 0; n < 1000; n++) { for (n = 0; n < 1000; n++) {
@ -215,6 +217,12 @@ mp_todecimal(&e, buf); printf("e = %s\n", buf);
mp_todecimal(&d, buf); printf("d = %s\n", buf); mp_todecimal(&d, buf); printf("d = %s\n", buf);
mp_todecimal(&c, buf); printf("c = %s\n", buf); mp_todecimal(&c, buf); printf("c = %s\n", buf);
printf("compare no compare!\n"); return EXIT_FAILURE; } printf("compare no compare!\n"); return EXIT_FAILURE; }
/* only one big montgomery reduction */
if (i > 10)
{
n = 1000;
ix = 100;
}
} }
} }
} }