AuroraMiddleware/libtommath
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

add minimal mp_sqrtmod_prime() tests to demo.c

Browse Source
This commit is contained in:
Steffen Jaeckel 2015-04-26 15:32:34 +02:00
parent d0f73e7c59
commit 91df2129ec
1 changed files with 25 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
demo/demo.c
View File

@ -103,6 +103,16 @@ static void _cleanup(void)
fclose(fd_urandom); fclose(fd_urandom);
#endif #endif
} }
struct mp_sqrtmod_prime_st {
unsigned long p;
unsigned long n;
mp_digit r;
};
struct mp_sqrtmod_prime_st sqrtmod_prime[] = {
{ 5, 14, 3 },
{ 7, 9, 4 },
{ 113, 2, 62 }
};
char cmd[4096], buf[4096]; char cmd[4096], buf[4096];
int main(void) int main(void)
@ -305,6 +315,21 @@ printf("compare no compare!\n"); return EXIT_FAILURE; }
} }
printf("\n\n"); printf("\n\n");
// r^2 = n (mod p)
for (i = 0; i < (int)(sizeof(sqrtmod_prime)/sizeof(sqrtmod_prime[0])); ++i) {
mp_set_int(&a, sqrtmod_prime[i].p);
mp_set_int(&b, sqrtmod_prime[i].n);
if (mp_sqrtmod_prime(&b, &a, &c) != MP_OKAY) {
printf("Failed executing %d. mp_sqrtmod_prime\n", (i+1));
return EXIT_FAILURE;
}
if (mp_cmp_d(&c, sqrtmod_prime[i].r) != MP_EQ) {
printf("Failed %d. trivial mp_sqrtmod_prime\n", (i+1));
ndraw(&c, "r");
return EXIT_FAILURE;
}
}
/* test for size */ /* test for size */
for (ix = 10; ix < 128; ix++) { for (ix = 10; ix < 128; ix++) {
printf("Testing (not safe-prime): %9d bits \r", ix); printf("Testing (not safe-prime): %9d bits \r", ix);