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

remove hard tab

Browse Source
This commit is contained in:
Francois Perrad 2015-11-26 18:43:42 +01:00
parent 15681f9a12
commit 0ff04a4f6f
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
bn_mp_sqrtmod_prime.c
View File

@ -31,7 +31,7 @@ int mp_sqrtmod_prime(mp_int *n, mp_int *prime, mp_int *ret)
if (legendre == -1) return MP_VAL; /* quadratic non-residue mod prime */ if (legendre == -1) return MP_VAL; /* quadratic non-residue mod prime */
if ((res = mp_init_multi(&t1, &C, &Q, &S, &Z, &M, &T, &R, &two, NULL)) != MP_OKAY) { if ((res = mp_init_multi(&t1, &C, &Q, &S, &Z, &M, &T, &R, &two, NULL)) != MP_OKAY) {
return res; return res;
} }
/* SPECIAL CASE: if prime mod 4 == 3 /* SPECIAL CASE: if prime mod 4 == 3