tommath/bn_mp_jacobi.c

97 lines
2.1 KiB
C
Raw Normal View History

2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
* LibTomMath is library that provides for multiple-precision
* integer arithmetic as well as number theoretic functionality.
*
* The library is designed directly after the MPI library by
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
2003-03-12 21:11:11 -05:00
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
2003-02-28 11:08:34 -05:00
*/
#include <tommath.h>
2003-05-17 08:33:54 -04:00
/* computes the jacobi c = (a | n) (or Legendre if n is prime)
2003-02-28 11:08:34 -05:00
* HAC pp. 73 Algorithm 2.149
*/
int
2003-07-02 11:39:39 -04:00
mp_jacobi (mp_int * a, mp_int * p, int *c)
2003-02-28 11:08:34 -05:00
{
2003-07-02 11:39:39 -04:00
mp_int a1, p1;
int k, s, r, res;
2003-02-28 11:09:08 -05:00
mp_digit residue;
2003-02-28 11:08:34 -05:00
/* step 1. if a == 0, return 0 */
if (mp_iszero (a) == 1) {
*c = 0;
return MP_OKAY;
}
/* step 2. if a == 1, return 1 */
if (mp_cmp_d (a, 1) == MP_EQ) {
*c = 1;
return MP_OKAY;
}
/* default */
2003-07-02 11:39:39 -04:00
k = s = 0;
2003-02-28 11:08:34 -05:00
2003-07-02 11:39:39 -04:00
/* step 3. write a = a1 * 2**k */
2003-02-28 11:08:34 -05:00
if ((res = mp_init_copy (&a1, a)) != MP_OKAY) {
return res;
}
2003-07-02 11:39:39 -04:00
if ((res = mp_init (&p1)) != MP_OKAY) {
2003-02-28 11:08:34 -05:00
goto __A1;
}
while (mp_iseven (&a1) == 1) {
2003-07-02 11:39:39 -04:00
k = k + 1;
2003-02-28 11:08:34 -05:00
if ((res = mp_div_2 (&a1, &a1)) != MP_OKAY) {
2003-07-02 11:39:39 -04:00
goto __P1;
2003-02-28 11:08:34 -05:00
}
}
/* step 4. if e is even set s=1 */
2003-07-02 11:39:39 -04:00
if ((k & 1) == 0) {
2003-02-28 11:08:34 -05:00
s = 1;
} else {
2003-07-02 11:39:39 -04:00
/* else set s=1 if p = 1/7 (mod 8) or s=-1 if p = 3/5 (mod 8) */
residue = p->dp[0] & 7;
2003-02-28 11:08:34 -05:00
if (residue == 1 || residue == 7) {
s = 1;
} else if (residue == 3 || residue == 5) {
s = -1;
}
}
2003-07-02 11:39:39 -04:00
/* step 5. if p == 3 (mod 4) *and* a1 == 3 (mod 4) then s = -s */
if ( ((p->dp[0] & 3) == 3) && ((a1.dp[0] & 3) == 3)) {
s = -s;
2003-02-28 11:08:34 -05:00
}
/* if a1 == 1 we're done */
if (mp_cmp_d (&a1, 1) == MP_EQ) {
*c = s;
} else {
/* n1 = n mod a1 */
2003-07-02 11:39:39 -04:00
if ((res = mp_mod (p, &a1, &p1)) != MP_OKAY) {
goto __P1;
2003-02-28 11:08:34 -05:00
}
2003-07-02 11:39:39 -04:00
if ((res = mp_jacobi (&p1, &a1, &r)) != MP_OKAY) {
goto __P1;
2003-02-28 11:08:34 -05:00
}
*c = s * r;
}
/* done */
res = MP_OKAY;
2003-07-02 11:39:39 -04:00
__P1:mp_clear (&p1);
2003-02-28 11:08:34 -05:00
__A1:mp_clear (&a1);
return res;
}