Home | History | Annotate | Download | only in libtommath

Lines Matching defs:a1

23   mp_int  a1, p1;
47 /* step 3. write a = a1 * 2**k */
48 if ((res = mp_init_copy (&a1, a)) != MP_OKAY) {
57 k = mp_cnt_lsb(&a1);
58 if ((res = mp_div_2d(&a1, k, &a1, NULL)) != MP_OKAY) {
76 /* step 5. if p == 3 (mod 4) *and* a1 == 3 (mod 4) then s = -s */
77 if ( ((p->dp[0] & 3) == 3) && ((a1.dp[0] & 3) == 3)) {
81 /* if a1 == 1 we're done */
82 if (mp_cmp_d (&a1, 1) == MP_EQ) {
85 /* n1 = n mod a1 */
86 if ((res = mp_mod (p, &a1, &p1)) != MP_OKAY) {
89 if ((res = mp_jacobi (&p1, &a1, &r)) != MP_OKAY) {
98 LBL_A1:mp_clear (&a1);